default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrancesco Maffioli
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[j63]Giulia Galbiati, Stefano Gualandi
, Francesco Maffioli:
On Minimum Reload Cost Cycle Cover. Discret. Appl. Math. 164: 112-120 (2014)- 2013
- [j62]Francesco Maffioli, Norma Zagaglia Salvi:
On Binary Matroids Not Isomorphic To Their Base Matroids. Ars Comb. 109: 247-256 (2013) - [j61]Stefano Gualandi, Francesco Maffioli, Claudio Magni:
A branch-and-price approach to k-clustering minimum biclique completion problem. Int. Trans. Oper. Res. 20(1): 101-117 (2013) - 2011
- [j60]Edoardo Amaldi, Giulia Galbiati, Francesco Maffioli:
On minimum reload cost paths, tours, and flows. Networks 57(3): 254-260 (2011) - [c14]Giulia Galbiati, Stefano Gualandi, Francesco Maffioli:
On Minimum Changeover Cost Arborescences. SEA 2011: 112-123 - 2010
- [j59]Francesco Maffioli, Norma Zagaglia Salvi:
A characterization of the base-matroids of a graphic matroid. Contributions Discret. Math. 5(1) (2010) - [j58]Florentine Bunke, Horst W. Hamacher, Francesco Maffioli, Anne M. Schwahn:
Minimum cut bases in undirected networks. Discret. Appl. Math. 158(4): 277-290 (2010) - [j57]Giulia Galbiati, Stefano Gualandi, Francesco Maffioli:
On Minimum Reload Cost Cycle Cover. Electron. Notes Discret. Math. 36: 81-88 (2010) - [j56]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) - [c13]Stefano Gualandi, Francesco Maffioli, Claudio Magni:
A Branch-and-price Approach to the k-Clustering Minimum Biclique Completion Problem. CTW 2010: 69-72
2000 – 2009
- 2009
- [j55]Edoardo Amaldi, Leo Liberti, Francesco Maffioli, Nelson Maculan:
Edge-swapping algorithms for the minimum fundamental cycle basis problem. Math. Methods Oper. Res. 69(2): 205-233 (2009) - 2008
- [c12]Edoardo Amaldi, Giulia Galbiati, Francesco Maffioli:
On minimum reload cost paths, tours and flows. CTW 2008: 112-115 - 2007
- [j54]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) - [j53]Francesco Maffioli, Romeo Rizzi, Stefano Benati:
Least and most colored bases. Discret. Appl. Math. 155(15): 1958-1970 (2007) - [j52]Giulia Galbiati, Francesco Maffioli:
Approximation algorithms for maximum cut with limited unbalance. Theor. Comput. Sci. 385(1-3): 78-87 (2007) - 2006
- [j51]Maurizio Bruglieri, Matthias Ehrgott, Horst W. Hamacher, Francesco Maffioli:
An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints. Discret. Appl. Math. 154(9): 1344-1357 (2006) - [j50]Francesco Maffioli, Norma Zagaglia Salvi:
On some properties of base-matroids. Discret. Appl. Math. 154(9): 1401-1407 (2006) - [j49]Ulrich Faigle, Leo Liberti, Francesco Maffioli, Stefan Pickl:
Graphs and combinatorial optimization. Discret. Optim. 3(3): 179 (2006) - [j48]Giulia Galbiati, Francesco Maffioli:
Approximating Max Cut with Limited Unbalance. Electron. Notes Discret. Math. 25: 101-104 (2006) - [j47]Maurizio Bruglieri, Francesco Maffioli, Marco Trubian:
Solving minimum K-cardinality cut problems in planar graphs. Networks 48(4): 195-208 (2006) - [c11]Giulia Galbiati, Francesco Maffioli:
Approximating Maximum Cut with Limited Unbalance. WAOA 2006: 202-213 - 2005
- [j46]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. Eur. J. Oper. Res. 163(1): 284-286 (2005) - 2004
- [j45]Roberto Cordone, Francesco Maffioli:
On the complexity of graph tree partition problems. Discret. Appl. Math. 134(1-3): 51-65 (2004) - [j44]Maurizio Bruglieri, Francesco Maffioli, Matthias Ehrgott:
Cardinality constrained minimum cut problems: complexity and algorithms. Discret. Appl. Math. 137(3): 311-341 (2004) - [j43]Leo Liberti, Francesco Maffioli:
Preface. Electron. Notes Discret. Math. 17: 1 (2004) - [j42]Edoardo Amaldi, Leo Liberti, Francesco Maffioli, Nelson Maculan:
Algorithms for finding minimum fundamental cycle bases in graphs. Electron. Notes Discret. Math. 17: 29-33 (2004) - [j41]Francesco Maffioli, Norma Zagaglia Salvi:
A particular class of graphic matroids. Electron. Notes Discret. Math. 17: 219-222 (2004) - [j40]Mauro Dell'Amico, Francesco Maffioli, Maria Luisa Merani:
A tree partitioning dynamic policy for OVSF codes assignment in wideband CDMA. IEEE Trans. Wirel. Commun. 3(4): 1013-1017 (2004) - [c10]Edoardo Amaldi, Leo Liberti, Francesco Maffioli:
Algorithms for Finding Minimum Fundamental Cycle Bases in Graphs. CTW 2004: 33-36 - [c9]Francesco Maffioli, Norma Zagaglia Salvi:
A Particular Class of Graphic Matroids. CTW 2004: 192-195 - [c8]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:
CTW04 Workshop on Graphs and Combinatorial Optimization, Scientific Program, Villa Vigoni, Menaggio (CO), Italy, 31st May to 2nd June 2004. 2004 [contents] - 2003
- [j39]Francesco Maffioli:
The vehicle routing problem: A book review. 4OR 1(2): 149-153 (2003) - [j38]Mauro Dell'Amico, Francesco Maffioli, Federico Malucelli:
The Base-matroid and Inverse Combinatorial Optimization Problems. Discret. Appl. Math. 128(2-3): 337-353 (2003) - [j37]Paola Cappanera, Giorgio Gallo, Francesco Maffioli:
Discrete facility location and routing of obnoxious activities. Discret. Appl. Math. 133(1-3): 3-28 (2003) - [j36]Francesco Maffioli, Norma Zagaglia Salvi:
On Some Properties of Base-matroids. Electron. Notes Discret. Math. 13: 69-70 (2003) - 2002
- [j35]Francesco Maffioli:
Book Reviews. Math. Methods Oper. Res. 56(2): 343-344 (2002) - [c7]Mauro Dell'Amico, Maria Luisa Merani, Francesco Maffioli:
Efficient algorithms for the assignment of OVSF codes in wideband CDMA. ICC 2002: 3055-3060 - 2001
- [j34]Eugène Manzi, Martine Labbé, Guy Latouche, Francesco Maffioli:
Fishman's sampling plan for computing network reliability. IEEE Trans. Reliab. 50(1): 41-46 (2001) - [c6]Roberto Cordone, Francesco Maffioli:
Coloured Ant System and Local Search to Design Local Telecommunication Networks. EvoWorkshops 2001: 60-69 - 2000
- [j33]Francesco Maffioli, Giulia Galbiati:
Approximability of hard combinatorial optimization problems: an introduction. Ann. Oper. Res. 96(1-4): 221-236 (2000) - [j32]Lorenzo Brunetta, Francesco Maffioli, Marco Trubian:
Solving the feedback vertex set problem on undirected graphs. Discret. Appl. Math. 101(1-3): 37-51 (2000) - [j31]Bernard Fortz, Martine Labbé, Francesco Maffioli:
Solving the Two-Connected Network with Bounded Meshes Problem. Oper. Res. 48(6): 866-877 (2000) - [j30]Mauro Dell'Amico, Francesco Maffioli:
Combining Linear and Non-Linear Objectives in Spanning Tree Problems. J. Comb. Optim. 4(2): 253-269 (2000)
1990 – 1999
- 1999
- [j29]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) - [j28]Giulia Galbiati, Francesco Maffioli, Carlo Viola:
Randomized Algorithms over Finite Fields for the Exact Parity Base Problem. J. Complex. 15(4): 537-556 (1999) - [j27]Mauro Dell'Amico, Martine Labbé, Francesco Maffioli:
Exact solution of the SONET Ring Loading Problem. Oper. Res. Lett. 25(3): 119-129 (1999) - 1998
- [j26]Mauro Dell'Amico, Francesco Maffioli, Anna Sciomachen:
A Lagrangian heuristic for the Prize CollectingTravelling Salesman Problem. Ann. Oper. Res. 81: 289-306 (1998) - [j25]Mauro Dell'Amico, Francesco Maffioli, Marco Trubian:
New bounds for optimum traffic assignment in satellite communication. Comput. Oper. Res. 25(9): 729-743 (1998) - 1997
- [j24]Francesco Maffioli, Anna Sciomachen:
A mixed-integer model for solving ordering problems with side constraints. Ann. Oper. Res. 69: 277-297 (1997) - [j23]Giulia Galbiati, Angelo Morzenti, Francesco Maffioli:
On the Approximability of Some Maximum Spanning Tree Problems. Theor. Comput. Sci. 181(1): 107-118 (1997) - 1996
- [j22]Mauro Dell'Amico, Francesco Maffioli:
on Some Multicriteria Arborescence Problems: Complexity and Algorithms. Discret. Appl. Math. 65(1-3): 191-206 (1996) - [j21]Mauro Dell'Amico, Martine Labbé, Francesco Maffioli:
Complexity of spanning tree problems with leaf-dependent objectives. Networks 27(3): 175-181 (1996) - [c5]Giulia Galbiati, Angelo Morzenti, Francesco Maffioli:
On the Logical Definability of Some Maximum Leaves Problems. DMTCS 1996: 214-225 - 1995
- [c4]Giulia Galbiati, Angelo Morzenti, Francesco Maffioli:
On the Approximability of some Maximum Spanning Tree Problems. LATIN 1995: 300-310 - 1994
- [j20]Giulia Galbiati, Francesco Maffioli:
on the Computation of Pfaffians. Discret. Appl. Math. 51(3): 269-275 (1994) - [j19]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) - [j18]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
- [j17]Giulia Galbiati, Francesco Maffioli:
Preface. Discret. Appl. Math. 42(2): 119 (1993) - [j16]Francesco Maffioli:
In Memoriam Paolo M. Camerini. Discret. Appl. Math. 42(2): 121-122 (1993) - [j15]Sung-Jin Chung, Horst W. Hamacher, Francesco Maffioli, Katta G. Murty:
Note on Combinatorial Optimization with Max-Linear Objective Functions. Discret. Appl. Math. 42(2): 139-145 (1993) - 1992
- [j14]Paolo M. Camerini, Giulia Galbiati, Francesco Maffioli:
Random Pseudo-Polynomial Algorithms for Exact Matroid Problems. J. Algorithms 13(2): 258-273 (1992) - [j13]Giulia Galbiati, Francesco Maffioli:
Constructing an Exact Parity Base Is in RNC2. Parallel Process. Lett. 2: 301-309 (1992) - 1991
- [j12]Paolo M. Camerini, Giulia Galbiati, Francesco Maffioli:
The image of weighted combinatorial problems. Ann. Oper. Res. 33(3): 181-197 (1991) - 1990
- [c3]Paolo M. Camerini, Giulia Galbiati, Francesco Maffioli:
Modular Arithmetic and Randomization for Exact Matroid Problems. IPCO 1990: 101-113
1980 – 1989
- 1989
- [j11]Paolo M. Camerini, Francesco Maffioli, Carlo Vercellis:
Multi-constrained matroidal knapsack problems. Math. Program. 45(1-3): 211-231 (1989) - 1986
- [j10]Giorgio Gallo, Francesco Maffioli:
Preface. Discret. Appl. Math. 14(2): 109-110 (1986) - [j9]Francesco Maffioli:
Randomized algorithms in combinatorial optimization: A survey. Discret. Appl. Math. 14(2): 157-170 (1986) - [j8]Paolo M. Camerini, Francesco Maffioli, Silvano Martello, Paolo Toth:
Most and least uniform spanning trees. Discret. Appl. Math. 15(2-3): 181-197 (1986) - 1984
- [j7]Francesco Maffioli, M. Grazia Speranza, Carlo Vercellis:
Randomized algorithms: An annotated bibliography - In alphabetical order. Ann. Oper. Res. 1(3): 331-345 (1984) - 1983
- [j6]Paolo M. Camerini, Giulia Galbiati, Francesco Maffioli:
On the complexity of finding multi-constrained spanning trees. Discret. Appl. Math. 5(1): 39-50 (1983) - 1982
- [j5]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
- [j4]Paolo M. Camerini, Luigi Fratta, Francesco Maffioli:
The k best spanning arborescences of a network. Networks 10(2): 91-109 (1980)
1970 – 1979
- 1979
- [j3]Paolo M. Camerini, Luigi Fratta, Francesco Maffioli:
A note on finding optimum branchings. Networks 9(4): 309-312 (1979) - 1978
- [j2]Paolo M. Camerini, Francesco Maffioli:
Heuristically guided algorithm for k-parity matroid problems. Discret. Math. 21(2): 103-116 (1978) - 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
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:49 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
