| 2008 |
|---|
| 44 | | Edoardo Amaldi,
Giulia Galbiati,
Francesco Maffioli:
On minimum reload cost paths, tours and flows.
CTW 2008: 112-115 |
| 2007 |
|---|
| 43 | EE | Pietro Belotti,
Martine Labbé,
Francesco Maffioli,
Malick M. Ndiaye:
A branch-and-cut method for the obnoxious p -median problem.
4OR 5(4): 299-314 (2007) |
| 42 | EE | Francesco Maffioli,
Romeo Rizzi,
Stefano Benati:
Least and most colored bases.
Discrete Applied Mathematics 155(15): 1958-1970 (2007) |
| 41 | EE | Giulia Galbiati,
Francesco Maffioli:
Approximation algorithms for maximum cut with limited unbalance.
Theor. Comput. Sci. 385(1-3): 78-87 (2007) |
| 2006 |
|---|
| 40 | EE | Giulia Galbiati,
Francesco Maffioli:
Approximating Maximum Cut with Limited Unbalance.
WAOA 2006: 202-213 |
| 39 | EE | Maurizio Bruglieri,
Matthias Ehrgott,
Horst W. Hamacher,
Francesco Maffioli:
An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints.
Discrete Applied Mathematics 154(9): 1344-1357 (2006) |
| 38 | EE | Francesco Maffioli,
Norma Zagaglia Salvi:
On some properties of base-matroids.
Discrete Applied Mathematics 154(9): 1401-1407 (2006) |
| 37 | EE | Ulrich Faigle,
Leo Liberti,
Francesco Maffioli,
Stefan Pickl:
Graphs and combinatorial optimization.
Discrete Optimization 3(3): 179 (2006) |
| 36 | EE | Giulia Galbiati,
Francesco Maffioli:
Approximating Max Cut with Limited Unbalance.
Electronic Notes in Discrete Mathematics 25: 101-104 (2006) |
| 35 | EE | Maurizio Bruglieri,
Francesco Maffioli,
Marco Trubian:
Solving minimum K-cardinality cut problems in planar graphs.
Networks 48(4): 195-208 (2006) |
| 2005 |
|---|
| 34 | EE | Francesco Maffioli:
In: Alexander Schrijver, Editors, Combinatorial Optimization-Polyhedra and Efficiency or All You Wanted to Know about Polyhedral Combinatorics and Never Dared to Ask.
European Journal of Operational Research 163(1): 284-286 (2005) |
| 2004 |
|---|
| 33 | EE | Edoardo Amaldi,
Leo Liberti,
Nelson Maculan,
Francesco Maffioli:
Efficient Edge-Swapping Heuristics for Finding Minimum Fundamental Cycle Bases.
WEA 2004: 14-29 |
| 32 | EE | Roberto Cordone,
Francesco Maffioli:
On the complexity of graph tree partition problems.
Discrete Applied Mathematics 134(1-3): 51-65 (2004) |
| 31 | EE | Maurizio Bruglieri,
Francesco Maffioli,
Matthias Ehrgott:
Cardinality constrained minimum cut problems: complexity and algorithms.
Discrete Applied Mathematics 137(3): 311-341 (2004) |
| 30 | EE | Leo Liberti,
Francesco Maffioli:
Preface.
Electronic Notes in Discrete Mathematics 17: 1 (2004) |
| 29 | EE | Francesco Maffioli,
Norma Zagaglia Salvi:
A particular class of graphic matroids.
Electronic Notes in Discrete Mathematics 17: 219-222 (2004) |
| 28 | EE | Edoardo Amaldi,
Leo Liberti,
Francesco Maffioli,
Nelson Maculan:
Algorithms for finding minimum fundamental cycle bases in graphs.
Electronic Notes in Discrete Mathematics 17: 29-33 (2004) |
| 27 | EE | Mauro Dell'Amico,
Francesco Maffioli,
Maria Luisa Merani:
A tree partitioning dynamic policy for OVSF codes assignment in wideband CDMA.
IEEE Transactions on Wireless Communications 3(4): 1013-1017 (2004) |
| 2003 |
|---|
| 26 | EE | Francesco Maffioli:
The vehicle routing problem: A book review.
4OR 1(2): 149-153 (2003) |
| 25 | EE | Mauro Dell'Amico,
Francesco Maffioli,
Federico Malucelli:
The Base-matroid and Inverse Combinatorial Optimization Problems.
Discrete Applied Mathematics 128(2-3): 337-353 (2003) |
| 24 | EE | P. Cappanera,
Giorgio Gallo,
Francesco Maffioli:
Discrete facility location and routing of obnoxious activities.
Discrete Applied Mathematics 133(1-3): 3-28 (2003) |
| 23 | EE | Francesco Maffioli,
Norma Zagaglia Salvi:
On Some Properties of Base-matroids.
Electronic Notes in Discrete Mathematics 13: 69-70 (2003) |
| 2001 |
|---|
| 22 | EE | Roberto Cordone,
Francesco Maffioli:
Coloured Ant System and Local Search to Design Local Telecommunication Networks.
EvoWorkshops 2001: 60-69 |
| 2000 |
|---|
| 21 | | Lorenzo Brunetta,
Francesco Maffioli,
Marco Trubian:
Solving the feedback vertex set problem on undirected graphs.
Discrete Applied Mathematics 101(1-3): 37-51 (2000) |
| 20 | | Mauro Dell'Amico,
Francesco Maffioli:
Combining Linear and Non-Linear Objectives in Spanning Tree Problems.
J. Comb. Optim. 4(2): 253-269 (2000) |
| 1999 |
|---|
| 19 | EE | Giulia Galbiati,
Francesco Maffioli,
Carlo Viola:
Randomized Algorithms over Finite Fields for the Exact Parity Base Problem.
J. Complexity 15(4): 537-556 (1999) |
| 18 | | Mauro Dell'Amico,
Andrea Lodi,
Francesco Maffioli:
Solution of the Cumulative Assignment Problem With a Well-Structured Tabu Search Method.
J. Heuristics 5(2): 123-143 (1999) |
| 17 | EE | Mauro Dell'Amico,
Martine Labbé,
Francesco Maffioli:
Exact solution of the SONET Ring Loading Problem.
Oper. Res. Lett. 25(3): 119-129 (1999) |
| 1998 |
|---|
| 16 | EE | Mauro Dell'Amico,
Francesco Maffioli,
Marco Trubian:
New bounds for optimum traffic assignment in satellite communication.
Computers & OR 25(9): 729-743 (1998) |
| 1997 |
|---|
| 15 | EE | Giulia Galbiati,
Angelo Morzenti,
Francesco Maffioli:
On the Approximability of Some Maximum Spanning Tree Problems.
Theor. Comput. Sci. 181(1): 107-118 (1997) |
| 1996 |
|---|
| 14 | EE | Mauro Dell'Amico,
Francesco Maffioli:
on Some Multicriteria Arborescence Problems: Complexity and Algorithms.
Discrete Applied Mathematics 65(1-3): 191-206 (1996) |
| 13 | EE | Mauro Dell'Amico,
Martine Labbé,
Francesco Maffioli:
Complexity of spanning tree problems with leaf-dependent objectives.
Networks 27(3): 175-181 (1996) |
| 1995 |
|---|
| 12 | | Giulia Galbiati,
Angelo Morzenti,
Francesco Maffioli:
On the Approximability of some Maximum Spanning Tree Problems.
LATIN 1995: 300-310 |
| 1994 |
|---|
| 11 | EE | Giulia Galbiati,
Francesco Maffioli:
on the Computation of Pfaffians.
Discrete Applied Mathematics 51(3): 269-275 (1994) |
| 10 | | Giulia Galbiati,
Francesco Maffioli,
Angelo Morzenti:
A Short Note on the Approximability of the Maximum Leaves Spanning Tree Problem.
Inf. Process. Lett. 52(1): 45-49 (1994) |
| 1993 |
|---|
| 9 | EE | Giulia Galbiati,
Francesco Maffioli:
Preface.
Discrete Applied Mathematics 42(2): 119 (1993) |
| 8 | EE | Francesco Maffioli:
In Memoriam Paolo M. Camerini.
Discrete Applied Mathematics 42(2): 121-122 (1993) |
| 7 | EE | Sung-Jin Chung,
Horst W. Hamacher,
Francesco Maffioli,
Katta G. Murty:
Note on Combinatorial Optimization with Max-Linear Objective Functions.
Discrete Applied Mathematics 42(2): 139-145 (1993) |
| 1992 |
|---|
| 6 | | Paolo M. Camerini,
Giulia Galbiati,
Francesco Maffioli:
Random Pseudo-Polynomial Algorithms for Exact Matroid Problems.
J. Algorithms 13(2): 258-273 (1992) |
| 5 | | Giulia Galbiati,
Francesco Maffioli:
Constructing an Exact Parity Base Is in RNC2.
Parallel Processing Letters 2: 301-309 (1992) |
| 1990 |
|---|
| 4 | | Paolo M. Camerini,
Giulia Galbiati,
Francesco Maffioli:
Modular Arithmetic and Randomization for Exact Matroid Problems.
IPCO 1990: 101-113 |
| 1975 |
|---|
| 3 | | Francesco Maffioli:
Subgradient Optimization, Matroid Problems and Heuristic Evaluation.
Optimization Techniques 1975: 389-396 |
| 2 | | Paolo M. Camerini,
Francesco Maffioli:
Bounds for 3-Matroid Intersection Problems.
Inf. Process. Lett. 3(3): 81-83 (1975) |
| 1973 |
|---|
| 1 | | Francesco Maffioli:
On Constrained Diameter and Medium Optimal Spanning Trees.
Optimization Techniques 1973: 110-117 |
