On Constrained Diameter and Medium Optimal Spanning Trees. - Francesco Maffioli (Optimization Techniques, 1973)

Subgradient Optimization, Matroid Problems and Heuristic Evaluation. - Francesco Maffioli (Optimization Techniques, 1975)

Bounds for 3-Matroid Intersection Problems. - Paolo M. Camerini; Francesco Maffioli (Inf. Process. Lett., 1975)

Heuristically guided algorithm for k-parity matroid problems. - Paolo M. Camerini; Francesco Maffioli (Discret. Math., 1978)

A note on finding optimum branchings. - Paolo M. Camerini; Luigi Fratta; Francesco Maffioli (Networks, 1979)

The k best spanning arborescences of a network. - Paolo M. Camerini; Luigi Fratta; Francesco Maffioli (Networks, 1980)

On the worst-case performance of some algorithms for the asymmetric traveling salesman problem. - Alan M. Frieze; Giulia Galbiati; Francesco Maffioli (Networks, 1982)

On the complexity of finding multi-constrained spanning trees. - Paolo M. Camerini; Giulia Galbiati; Francesco Maffioli (Discret. Appl. Math., 1983)

Randomized algorithms: An annotated bibliography - In alphabetical order. - Francesco Maffioli; M. Grazia Speranza; Carlo Vercellis (Ann. Oper. Res., 1984)

Most and least uniform spanning trees. - Paolo M. Camerini; Francesco Maffioli; Silvano Martello; Paolo Toth (Discret. Appl. Math., 1986)

Preface. - Giorgio Gallo; Francesco Maffioli (Discret. Appl. Math., 1986)

Randomized algorithms in combinatorial optimization: A survey. - Francesco Maffioli (Discret. Appl. Math., 1986)

Multi-constrained matroidal knapsack problems. - Paolo M. Camerini; Francesco Maffioli; Carlo Vercellis (Math. Program., 1989)

Modular Arithmetic and Randomization for Exact Matroid Problems. - Paolo M. Camerini; Giulia Galbiati; Francesco Maffioli (IPCO, 1990)

The image of weighted combinatorial problems. - Paolo M. Camerini; Giulia Galbiati; Francesco Maffioli (Ann. Oper. Res., 1991)

Random Pseudo-Polynomial Algorithms for Exact Matroid Problems. - Paolo M. Camerini; Giulia Galbiati; Francesco Maffioli (J. Algorithms, 1992)

Constructing an Exact Parity Base Is in RNC2. - Giulia Galbiati; Francesco Maffioli (Parallel Process. Lett., 1992)

Note on Combinatorial Optimization with Max-Linear Objective Functions. - Sung-Jin Chung; Horst W. Hamacher; Francesco Maffioli; Katta G. Murty (Discret. Appl. Math., 1993)

Preface. - Giulia Galbiati; Francesco Maffioli (Discret. Appl. Math., 1993)

In Memoriam Paolo M. Camerini. - Francesco Maffioli (Discret. Appl. Math., 1993)

on the Computation of Pfaffians. - Giulia Galbiati; Francesco Maffioli (Discret. Appl. Math., 1994)

A Short Note on the Approximability of the Maximum Leaves Spanning Tree Problem. - Giulia Galbiati; Francesco Maffioli; Angelo Morzenti (Inf. Process. Lett., 1994)

Weighted k-cardinality trees: Complexity and polyhedral structure. - Matteo Fischetti; Horst W. Hamacher; Kurt Jørnsten; Francesco Maffioli (Networks, 1994)

On the Logical Definability of Some Maximum Leaves Problems. - Giulia Galbiati; Angelo Morzenti; Francesco Maffioli (DMTCS, 1996)

on Some Multicriteria Arborescence Problems: Complexity and Algorithms. - Mauro Dell'Amico; Francesco Maffioli (Discret. Appl. Math., 1996)

Complexity of spanning tree problems with leaf-dependent objectives. - Mauro Dell'Amico; Martine Labbé; Francesco Maffioli (Networks, 1996)

A mixed-integer model for solving ordering problems with side constraints. - Francesco Maffioli; Anna Sciomachen (Ann. Oper. Res., 1997)

On the Approximability of Some Maximum Spanning Tree Problems. - Giulia Galbiati; Angelo Morzenti; Francesco Maffioli (Theor. Comput. Sci., 1997)

A Lagrangian heuristic for the Prize CollectingTravelling Salesman Problem. - Mauro Dell'Amico; Francesco Maffioli; Anna Sciomachen (Ann. Oper. Res., 1998)

New bounds for optimum traffic assignment in satellite communication. - Mauro Dell'Amico; Francesco Maffioli; Marco Trubian (Comput. Oper. Res., 1998)

Solution of the Cumulative Assignment Problem With a Well-Structured Tabu Search Method. - Mauro Dell'Amico; Andrea Lodi 001; Francesco Maffioli (J. Heuristics, 1999)

Randomized Algorithms over Finite Fields for the Exact Parity Base Problem. - Giulia Galbiati; Francesco Maffioli; Carlo Viola (J. Complex., 1999)

Exact solution of the SONET Ring Loading Problem. - Mauro Dell'Amico; Martine Labbé; Francesco Maffioli (Oper. Res. Lett., 1999)

Approximability of hard combinatorial optimization problems: an introduction. - Francesco Maffioli; Giulia Galbiati (Ann. Oper. Res., 2000)

Solving the feedback vertex set problem on undirected graphs. - Lorenzo Brunetta; Francesco Maffioli; Marco Trubian (Discret. Appl. Math., 2000)

Solving the Two-Connected Network with Bounded Meshes Problem. - Bernard Fortz; Martine Labbé; Francesco Maffioli (Oper. Res., 2000)

Combining Linear and Non-Linear Objectives in Spanning Tree Problems. - Mauro Dell'Amico; Francesco Maffioli (J. Comb. Optim., 2000)

Coloured Ant System and Local Search to Design Local Telecommunication Networks. - Roberto Cordone; Francesco Maffioli (EvoWorkshops, 2001)

Fishman's sampling plan for computing network reliability. - Eugène Manzi; Martine Labbé; Guy Latouche; Francesco Maffioli (IEEE Trans. Reliab., 2001)

Efficient algorithms for the assignment of OVSF codes in wideband CDMA. - Mauro Dell'Amico; Maria Luisa Merani; Francesco Maffioli (ICC, 2002)

Book Reviews. - Francesco Maffioli (Math. Methods Oper. Res., 2002)

The vehicle routing problem: A book review. - Francesco Maffioli (4OR, 2003)

Discrete facility location and routing of obnoxious activities. - Paola Cappanera; Giorgio Gallo; Francesco Maffioli (Discret. Appl. Math., 2003)

The Base-matroid and Inverse Combinatorial Optimization Problems. - Mauro Dell'Amico; Francesco Maffioli; Federico Malucelli (Discret. Appl. Math., 2003)

Algorithms for Finding Minimum Fundamental Cycle Bases in Graphs. - Edoardo Amaldi; Leo Liberti; Francesco Maffioli (CTW, 2004)

Efficient Edge-Swapping Heuristics for Finding Minimum Fundamental Cycle Bases. - Edoardo Amaldi; Leo Liberti; Nelson Maculan; Francesco Maffioli (WEA, 2004)

Cardinality constrained minimum cut problems: complexity and algorithms. - Maurizio Bruglieri; Francesco Maffioli; Matthias Ehrgott (Discret. Appl. Math., 2004)

On the complexity of graph tree partition problems. - Roberto Cordone; Francesco Maffioli (Discret. Appl. Math., 2004)

Algorithms for finding minimum fundamental cycle bases in graphs. - Edoardo Amaldi; Leo Liberti; Francesco Maffioli; Nelson Maculan (Electron. Notes Discret. Math., 2004)

Preface. - Leo Liberti; Francesco Maffioli (Electron. Notes Discret. Math., 2004)

A particular class of graphic matroids. - Francesco Maffioli; Norma Zagaglia Salvi (Electron. Notes Discret. Math., 2004)

A tree partitioning dynamic policy for OVSF codes assignment in wideband CDMA. - Mauro Dell'Amico; Francesco Maffioli; Maria Luisa Merani (IEEE Trans. Wirel. Commun., 2004)

In: Alexander Schrijver, Editors, Combinatorial Optimization-Polyhedra and Efficiency or All You Wanted to Know about Polyhedral Combinatorics and Never Dared to Ask. - Francesco Maffioli (Eur. J. Oper. Res., 2005)

Approximating Maximum Cut with Limited Unbalance. - Giulia Galbiati; Francesco Maffioli (WAOA, 2006)

An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints. - Maurizio Bruglieri; Matthias Ehrgott; Horst W. Hamacher; Francesco Maffioli (Discret. Appl. Math., 2006)

On some properties of base-matroids. - Francesco Maffioli; Norma Zagaglia Salvi (Discret. Appl. Math., 2006)

Graphs and combinatorial optimization. - Ulrich Faigle; Leo Liberti; Francesco Maffioli; Stefan Pickl (Discret. Optim., 2006)

Approximating Max Cut with Limited Unbalance. - Giulia Galbiati; Francesco Maffioli (Electron. Notes Discret. Math., 2006)

Solving minimum K-cardinality cut problems in planar graphs. - Maurizio Bruglieri; Francesco Maffioli; Marco Trubian (Networks, 2006)

A branch-and-cut method for the obnoxious p -median problem. - Pietro Belotti; Martine Labbé; Francesco Maffioli; Malick M. Ndiaye (4OR, 2007)

Least and most colored bases. - Francesco Maffioli; Romeo Rizzi; Stefano Benati (Discret. Appl. Math., 2007)

Approximation algorithms for maximum cut with limited unbalance. - Giulia Galbiati; Francesco Maffioli (Theor. Comput. Sci., 2007)

Edge-swapping algorithms for the minimum fundamental cycle basis problem. - Edoardo Amaldi; Leo Liberti; Francesco Maffioli; Nelson Maculan (Math. Methods Oper. Res., 2009)

A Branch-and-price Approach to the k-Clustering Minimum Biclique Completion Problem. - Stefano Gualandi; Francesco Maffioli; Claudio Magni (CTW, 2010)

A characterization of the base-matroids of a graphic matroid. - Francesco Maffioli; Norma Zagaglia Salvi (Contributions Discret. Math., 2010)

Minimum cut bases in undirected networks. - Florentine Bunke; Horst W. Hamacher; Francesco Maffioli; Anne M. Schwahn (Discret. Appl. Math., 2010)

Computational experience with a SDP-based algorithm for maximum cut with limited unbalance. - Giulia Galbiati; Stefano Gualandi; Francesco Maffioli (Networks, 2010)

On Minimum Changeover Cost Arborescences. - Giulia Galbiati; Stefano Gualandi; Francesco Maffioli (SEA, 2011)

On minimum reload cost paths, tours, and flows. - Edoardo Amaldi; Giulia Galbiati; Francesco Maffioli (Networks, 2011)

On Binary Matroids Not Isomorphic To Their Base Matroids. - Francesco Maffioli; Norma Zagaglia Salvi (Ars Comb., 2013)

A branch-and-price approach to k-clustering minimum biclique completion problem. - Stefano Gualandi; Francesco Maffioli; Claudio Magni (Int. Trans. Oper. Res., 2013)

On Minimum Reload Cost Cycle Cover. - Giulia Galbiati; Stefano Gualandi; Francesco Maffioli (Discret. Appl. Math., 2014)