Search the dblp DataBase
Francesco Maffioli :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Roberto Cordone , Francesco Maffioli Coloured Ant System and Local Search to Design Local Telecommunication Networks. [Citation Graph (0, 0)][DBLP ] EvoWorkshops, 2001, pp:60-69 [Conf ] Francesco Maffioli On Constrained Diameter and Medium Optimal Spanning Trees. [Citation Graph (0, 0)][DBLP ] Optimization Techniques, 1973, pp:110-117 [Conf ] Francesco Maffioli Subgradient Optimization, Matroid Problems and Heuristic Evaluation. [Citation Graph (0, 0)][DBLP ] Optimization Techniques, 1975, pp:389-396 [Conf ] Paolo M. Camerini , Giulia Galbiati , Francesco Maffioli Modular Arithmetic and Randomization for Exact Matroid Problems. [Citation Graph (0, 0)][DBLP ] IPCO, 1990, pp:101-113 [Conf ] Giulia Galbiati , Angelo Morzenti , Francesco Maffioli On the Approximability of some Maximum Spanning Tree Problems. [Citation Graph (0, 0)][DBLP ] LATIN, 1995, pp:300-310 [Conf ] Giulia Galbiati , Francesco Maffioli Approximating Maximum Cut with Limited Unbalance. [Citation Graph (0, 0)][DBLP ] WAOA, 2006, pp:202-213 [Conf ] Edoardo Amaldi , Leo Liberti , Nelson Maculan , Francesco Maffioli Efficient Edge-Swapping Heuristics for Finding Minimum Fundamental Cycle Bases. [Citation Graph (0, 0)][DBLP ] WEA, 2004, pp:14-29 [Conf ] Francesco Maffioli The vehicle routing problem: A book review. [Citation Graph (0, 0)][DBLP ] 4OR, 2003, v:1, n:2, pp:149-153 [Journal ] Mauro Dell'Amico , Francesco Maffioli , Marco Trubian New bounds for optimum traffic assignment in satellite communication. [Citation Graph (0, 0)][DBLP ] Computers & OR, 1998, v:25, n:9, pp:729-743 [Journal ] Maurizio Bruglieri , Francesco Maffioli , Matthias Ehrgott Cardinality constrained minimum cut problems: complexity and algorithms. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2004, v:137, n:3, pp:311-341 [Journal ] Lorenzo Brunetta , Francesco Maffioli , Marco Trubian Solving the feedback vertex set problem on undirected graphs. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2000, v:101, n:1-3, pp:37-51 [Journal ] P. Cappanera , Giorgio Gallo , Francesco Maffioli Discrete facility location and routing of obnoxious activities. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2003, v:133, n:1-3, pp:3-28 [Journal ] Sung-Jin Chung , Horst W. Hamacher , Francesco Maffioli , Katta G. Murty Note on Combinatorial Optimization with Max-Linear Objective Functions. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1993, v:42, n:2, pp:139-145 [Journal ] Roberto Cordone , Francesco Maffioli On the complexity of graph tree partition problems. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2004, v:134, n:1-3, pp:51-65 [Journal ] Mauro Dell'Amico , Francesco Maffioli on Some Multicriteria Arborescence Problems: Complexity and Algorithms. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1996, v:65, n:1-3, pp:191-206 [Journal ] Mauro Dell'Amico , Francesco Maffioli , Federico Malucelli The Base-matroid and Inverse Combinatorial Optimization Problems. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2003, v:128, n:2-3, pp:337-353 [Journal ] Giulia Galbiati , Francesco Maffioli Preface. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1993, v:42, n:2, pp:119- [Journal ] Giulia Galbiati , Francesco Maffioli on the Computation of Pfaffians. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1994, v:51, n:3, pp:269-275 [Journal ] Francesco Maffioli In Memoriam Paolo M. Camerini. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1993, v:42, n:2, pp:121-122 [Journal ] Maurizio Bruglieri , Matthias Ehrgott , Horst W. Hamacher , Francesco Maffioli An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2006, v:154, n:9, pp:1344-1357 [Journal ] Francesco Maffioli , Norma Zagaglia Salvi On some properties of base-matroids. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2006, v:154, n:9, pp:1401-1407 [Journal ] Mauro Dell'Amico , Andrea Lodi , Francesco Maffioli Solution of the Cumulative Assignment Problem With a Well-Structured Tabu Search Method. [Citation Graph (0, 0)][DBLP ] J. Heuristics, 1999, v:5, n:2, pp:123-143 [Journal ] Paolo M. Camerini , Francesco Maffioli Bounds for 3-Matroid Intersection Problems. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1975, v:3, n:3, pp:81-83 [Journal ] Giulia Galbiati , Francesco Maffioli , Angelo Morzenti A Short Note on the Approximability of the Maximum Leaves Spanning Tree Problem. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1994, v:52, n:1, pp:45-49 [Journal ] Paolo M. Camerini , Giulia Galbiati , Francesco Maffioli Random Pseudo-Polynomial Algorithms for Exact Matroid Problems. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1992, v:13, n:2, pp:258-273 [Journal ] Giulia Galbiati , Francesco Maffioli , Carlo Viola Randomized Algorithms over Finite Fields for the Exact Parity Base Problem. [Citation Graph (0, 0)][DBLP ] J. Complexity, 1999, v:15, n:4, pp:537-556 [Journal ] Mauro Dell'Amico , Francesco Maffioli Combining Linear and Non-Linear Objectives in Spanning Tree Problems. [Citation Graph (0, 0)][DBLP ] J. Comb. Optim., 2000, v:4, n:2, pp:253-269 [Journal ] Mauro Dell'Amico , Martine Labbé , Francesco Maffioli Complexity of spanning tree problems with leaf-dependent objectives. [Citation Graph (0, 0)][DBLP ] Networks, 1996, v:27, n:3, pp:175-181 [Journal ] Maurizio Bruglieri , Francesco Maffioli , Marco Trubian Solving minimum K-cardinality cut problems in planar graphs. [Citation Graph (0, 0)][DBLP ] Networks, 2006, v:48, n:4, pp:195-208 [Journal ] Mauro Dell'Amico , Martine Labbé , Francesco Maffioli Exact solution of the SONET Ring Loading Problem. [Citation Graph (0, 0)][DBLP ] Oper. Res. Lett., 1999, v:25, n:3, pp:119-129 [Journal ] Giulia Galbiati , Francesco Maffioli Constructing an Exact Parity Base Is in RNC2 . [Citation Graph (0, 0)][DBLP ] Parallel Processing Letters, 1992, v:2, n:, pp:301-309 [Journal ] Giulia Galbiati , Angelo Morzenti , Francesco Maffioli On the Approximability of Some Maximum Spanning Tree Problems. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1997, v:181, n:1, pp:107-118 [Journal ] 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. [Citation Graph (0, 0)][DBLP ] European Journal of Operational Research, 2005, v:163, n:1, pp:284-286 [Journal ] Francesco Maffioli , Romeo Rizzi , Stefano Benati Least and most colored bases. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2007, v:155, n:15, pp:1958-1970 [Journal ] Giulia Galbiati , Francesco Maffioli Approximation algorithms for maximum cut with limited unbalance. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2007, v:385, n:1-3, pp:78-87 [Journal ] On minimum reload cost paths, tours and flows. [Citation Graph (, )][DBLP ] A branch-and-cut method for the obnoxious p -median problem. [Citation Graph (, )][DBLP ] Minimum cut bases in undirected networks. [Citation Graph (, )][DBLP ] Search in 0.005secs, Finished in 0.009secs