- CSB - MetaPress - Google - Bing - Yahoo
 | 2011 | |
|---|---|---|
| j47 |      | Edoardo Amaldi, Giulia Galbiati, Francesco Maffioli: On minimum reload cost paths, tours, and flows. Networks 57(3): 254-260 (2011) |
| c13 | | Giulia Galbiati, Stefano Gualandi, Francesco Maffioli: On Minimum Changeover Cost Arborescences. SEA 2011: 112-123 |
| 2010 | ||
| j46 | | Francesco Maffioli, Norma Zagaglia Salvi: A characterization of the base-matroids of a graphic matroid. Contributions to Discrete Mathematics 5(1) (2010) |
| j45 | | Florentine Bunke, Horst W. Hamacher, Francesco Maffioli, Anne M. Schwahn: Minimum cut bases in undirected networks. Discrete Applied Mathematics 158(4): 277-290 (2010) |
| j44 | | Giulia Galbiati, Stefano Gualandi, Francesco Maffioli: On Minimum Reload Cost Cycle Cover. Electronic Notes in Discrete Mathematics 36: 81-88 (2010) |
| j43 | | Giulia Galbiati, Stefano Gualandi, Francesco Maffioli: Computational experience with a SDP-based algorithm for maximum cut with limited unbalance. Networks 55(3): 247-255 (2010) |
| c12 |  | Stefano Gualandi, Francesco Maffioli, Claudio Magni: A Branch-and-price Approach to the k-Clustering Minimum Biclique Completion Problem. CTW 2010: 69-72 |
| 2009 | ||
| j42 | | Edoardo Amaldi, Leo Liberti, Francesco Maffioli, Nelson Maculan: Edge-swapping algorithms for the minimum fundamental cycle basis problem. Math. Meth. of OR 69(2): 205-233 (2009) |
| 2008 | ||
| c11 | | Edoardo Amaldi, Giulia Galbiati, Francesco Maffioli: On minimum reload cost paths, tours and flows. CTW 2008: 112-115 |
| 2007 | ||
| j41 | | 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) |
| j40 | | Francesco Maffioli, Romeo Rizzi, Stefano Benati: Least and most colored bases. Discrete Applied Mathematics 155(15): 1958-1970 (2007) |
| j39 | | Giulia Galbiati, Francesco Maffioli: Approximation algorithms for maximum cut with limited unbalance. Theor. Comput. Sci. 385(1-3): 78-87 (2007) |
| 2006 | ||
| j38 | | 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) |
| j37 | | Francesco Maffioli, Norma Zagaglia Salvi: On some properties of base-matroids. Discrete Applied Mathematics 154(9): 1401-1407 (2006) |
| j36 | | Ulrich Faigle, Leo Liberti, Francesco Maffioli, Stefan Pickl: Graphs and combinatorial optimization. Discrete Optimization 3(3): 179 (2006) |
| j35 | | Giulia Galbiati, Francesco Maffioli: Approximating Max Cut with Limited Unbalance. Electronic Notes in Discrete Mathematics 25: 101-104 (2006) |
| j34 | | Maurizio Bruglieri, Francesco Maffioli, Marco Trubian: Solving minimum K-cardinality cut problems in planar graphs. Networks 48(4): 195-208 (2006) |
| c10 | | Giulia Galbiati, Francesco Maffioli: Approximating Maximum Cut with Limited Unbalance. WAOA 2006: 202-213 |
| 2005 | ||
| j33 | | 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 | ||
| j32 | | Roberto Cordone, Francesco Maffioli: On the complexity of graph tree partition problems. Discrete Applied Mathematics 134(1-3): 51-65 (2004) |
| j31 | | Maurizio Bruglieri, Francesco Maffioli, Matthias Ehrgott: Cardinality constrained minimum cut problems: complexity and algorithms. Discrete Applied Mathematics 137(3): 311-341 (2004) |
| j30 | | |
| j29 | | 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) |
| j28 | | Francesco Maffioli, Norma Zagaglia Salvi: A particular class of graphic matroids. Electronic Notes in Discrete Mathematics 17: 219-222 (2004) |
| j27 | | 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) |
| c9 | | Edoardo Amaldi, Leo Liberti, Francesco Maffioli: Algorithms for Finding Minimum Fundamental Cycle Bases in Graphs. CTW 2004: 33-36 |
| c8 | | |
| c7 | | Edoardo Amaldi, Leo Liberti, Nelson Maculan, Francesco Maffioli: Efficient Edge-Swapping Heuristics for Finding Minimum Fundamental Cycle Bases. WEA 2004: 14-29 |
| e1 | | Leo Liberti, Francesco Maffioli (Eds.): CTW04 Workshop on Graphs and Combinatorial Optimization, Scientific Program, Villa Vigoni, Menaggio (CO), Italy, 31st May to 2nd June 2004. 2004 |
| 2003 | ||
| j26 | | |
| j25 | | Mauro Dell'Amico, Francesco Maffioli, Federico Malucelli: The Base-matroid and Inverse Combinatorial Optimization Problems. Discrete Applied Mathematics 128(2-3): 337-353 (2003) |
| j24 | | Paola Cappanera, Giorgio Gallo, Francesco Maffioli: Discrete facility location and routing of obnoxious activities. Discrete Applied Mathematics 133(1-3): 3-28 (2003) |
| j23 | | Francesco Maffioli, Norma Zagaglia Salvi: On Some Properties of Base-matroids. Electronic Notes in Discrete Mathematics 13: 69-70 (2003) |
| 2002 | ||
| j22 | | |
| c6 | | Mauro Dell'Amico, Maria Luisa Merani, Francesco Maffioli: Efficient algorithms for the assignment of OVSF codes in wideband CDMA. ICC 2002: 3055-3060 |
| 2001 | ||
| c5 | | Roberto Cordone, Francesco Maffioli: Coloured Ant System and Local Search to Design Local Telecommunication Networks. EvoWorkshops 2001: 60-69 |
| 2000 | ||
| j21 | | Lorenzo Brunetta, Francesco Maffioli, Marco Trubian: Solving the feedback vertex set problem on undirected graphs. Discrete Applied Mathematics 101(1-3): 37-51 (2000) |
| j20 | | Mauro Dell'Amico, Francesco Maffioli: Combining Linear and Non-Linear Objectives in Spanning Tree Problems. J. Comb. Optim. 4(2): 253-269 (2000) |
| 1999 | ||
| j19 | | 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) |
| j18 | | Giulia Galbiati, Francesco Maffioli, Carlo Viola: Randomized Algorithms over Finite Fields for the Exact Parity Base Problem. J. Complexity 15(4): 537-556 (1999) |
| j17 | | Mauro Dell'Amico, Martine Labbé, Francesco Maffioli: Exact solution of the SONET Ring Loading Problem. Oper. Res. Lett. 25(3): 119-129 (1999) |
| 1998 | ||
| j16 | | Mauro Dell'Amico, Francesco Maffioli, Marco Trubian: New bounds for optimum traffic assignment in satellite communication. Computers & OR 25(9): 729-743 (1998) |
| 1997 | ||
| j15 | | Giulia Galbiati, Angelo Morzenti, Francesco Maffioli: On the Approximability of Some Maximum Spanning Tree Problems. Theor. Comput. Sci. 181(1): 107-118 (1997) |
| 1996 | ||
| j14 | | Mauro Dell'Amico, Francesco Maffioli: on Some Multicriteria Arborescence Problems: Complexity and Algorithms. Discrete Applied Mathematics 65(1-3): 191-206 (1996) |
| j13 | | Mauro Dell'Amico, Martine Labbé, Francesco Maffioli: Complexity of spanning tree problems with leaf-dependent objectives. Networks 27(3): 175-181 (1996) |
| 1995 | ||
| c4 | | Giulia Galbiati, Angelo Morzenti, Francesco Maffioli: On the Approximability of some Maximum Spanning Tree Problems. LATIN 1995: 300-310 |
| 1994 | ||
| j12 | | Giulia Galbiati, Francesco Maffioli: on the Computation of Pfaffians. Discrete Applied Mathematics 51(3): 269-275 (1994) |
| j11 | | 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) |
| j10 | | Matteo Fischetti, Horst W. Hamacher, Kurt Jørnsten, Francesco Maffioli: Weighted k-cardinality trees: Complexity and polyhedral structure. Networks 24(1): 11-21 (1994) |
| 1993 | ||
| j9 | | |
| j8 | | Francesco Maffioli: In Memoriam Paolo M. Camerini. Discrete Applied Mathematics 42(2): 121-122 (1993) |
| j7 | | 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 | ||
| j6 | | Paolo M. Camerini, Giulia Galbiati, Francesco Maffioli: Random Pseudo-Polynomial Algorithms for Exact Matroid Problems. J. Algorithms 13(2): 258-273 (1992) |
| j5 | | Giulia Galbiati, Francesco Maffioli: Constructing an Exact Parity Base Is in RNC2. Parallel Processing Letters 2: 301-309 (1992) |
| 1990 | ||
| c3 | | Paolo M. Camerini, Giulia Galbiati, Francesco Maffioli: Modular Arithmetic and Randomization for Exact Matroid Problems. IPCO 1990: 101-113 |
| 1982 | ||
| j4 | | Alan M. Frieze, Giulia Galbiati, Francesco Maffioli: On the worst-case performance of some algorithms for the asymmetric traveling salesman problem. Networks 12(1): 23-39 (1982) |
| 1980 | ||
| j3 | | Paolo M. Camerini, Luigi Fratta, Francesco Maffioli: The k best spanning arborescences of a network. Networks 10(2): 91-109 (1980) |
| 1979 | ||
| j2 | | Paolo M. Camerini, Luigi Fratta, Francesco Maffioli: A note on finding optimum branchings. Networks 9(4): 309-312 (1979) |
| 1975 | ||
| j1 | | Paolo M. Camerini, Francesco Maffioli: Bounds for 3-Matroid Intersection Problems. Inf. Process. Lett. 3(3): 81-83 (1975) |
| c2 | | Francesco Maffioli: Subgradient Optimization, Matroid Problems and Heuristic Evaluation. Optimization Techniques 1975: 389-396 |
| 1973 | ||
| c1 | | Francesco Maffioli: On Constrained Diameter and Medium Optimal Spanning Trees. Optimization Techniques 1973: 110-117 |
Data released under the ODC-BY 1.0 license — See also our legal information page