I agree that this site is using cookies. You can find further informations here.
X
Maffioli, Francesco
179  results:
Search for persons X
?
1

On Minimum Reload Cost Cycle Cover:

Galbiati, Giulia ; Gualandi, Stefano ; Maffioli, Francesco
Discrete Applied Mathematics.  164 (2014)  - p. 112-120 , 2014
Link: https://doi.org/10.1016/..
 
?
2

A branch‐and‐price approach to k‐clustering minimum bicliqu..:

Gualandi, Stefano ; Maffioli, Francesco ; Magni, Claudio
International Transactions in Operational Research.  20 (2012)  1 - p. 101-117 , 2012
Link: https://doi.org/10.1111/..
 
?
3

Computational experience with a SDP‐based algorithm for max..:

Galbiati, Giulia ; Gualandi, Stefano ; Maffioli, Francesco
Networks.  55 (2010)  3 - p. 247-255 , 2010
Link: https://doi.org/10.1002/..
 
?
4

On minimum reload cost paths, tours, and flows:

Amaldi, Edoardo ; Galbiati, Giulia ; Maffioli, Francesco
Networks.  57 (2010)  3 - p. 254-260 , 2010
Link: https://doi.org/10.1002/..
 
?
5

Minimum cut bases in undirected networks:

Bunke, Florentine ; Hamacher, Horst W. ; Maffioli, Francesco.
Discrete Applied Mathematics.  158 (2010)  4 - p. 277-290 , 2010
Link: https://doi.org/10.1016/..
 
?
6

On Minimum Reload Cost Cycle Cover:

Galbiati, Giulia ; Gualandi, Stefano ; Maffioli, Francesco
Electronic Notes in Discrete Mathematics.  36 (2010)  - p. 81-88 , 2010
Link: https://doi.org/10.1016/..
 
?
7

Edge-swapping algorithms for the minimum fundamental cycle ..:

Amaldi, Edoardo ; Liberti, Leo ; Maffioli, Francesco.
Mathematical Methods of Operations Research.  69 (2008)  2 - p. 205-233 , 2008
Link: https://doi.org/10.1007/..
 
?
8

Least and most colored bases:

Maffioli, Francesco ; Rizzi, Romeo ; Benati, Stefano
Discrete Applied Mathematics.  155 (2007)  15 - p. 1958-1970 , 2007
Link: https://doi.org/10.1016/..
 
?
9

Approximation algorithms for maximum cut with limited unbal..:

Galbiati, Giulia ; Maffioli, Francesco
Theoretical Computer Science.  385 (2007)  1-3 - p. 78-87 , 2007
Link: https://doi.org/10.1016/..
 
?
10

An annotated bibliography of combinatorial optimization pro..:

Bruglieri, Maurizio ; Ehrgott, Matthias ; Hamacher, Horst W..
Discrete Applied Mathematics.  154 (2006)  9 - p. 1344-1357 , 2006
Link: https://doi.org/10.1016/..
 
?
11

Solving minimum K‐cardinality cut problems in planar graphs:

Bruglieri, Maurizio ; Maffioli, Francesco ; Trubian, Marco
Networks.  48 (2006)  4 - p. 195-208 , 2006
Link: https://doi.org/10.1002/..
 
?
12

A branch-and-cut method for the obnoxious p-median problem:

Belotti, Pietro ; Labbé, Martine ; Maffioli, Francesco.
4OR.  5 (2006)  4 - p. 299-314 , 2006
Link: https://doi.org/10.1007/..
 
?
13

Graphs and combinatorial optimization:

Faigle, Ulrich ; Liberti, Leo ; Maffioli, Francesco.
Discrete Optimization.  3 (2006)  3 - p. 179 , 2006
Link: https://doi.org/10.1016/..
 
?
14

Mathematical models and a constructive heuristic for findin..:

Liberti, Leo ; Amaldi, Edoardo ; Maffioli, Francesco.
Yugoslav Journal of Operations Research; YUJOR.  15 (2005)  1 - p. 15-24 , 2005
Link: https://doi.org/10.2298/..
 
?
15

Erasmus Thematic Networks and the European dimension of Eng..:

Borri, Claudio ; Guberti, Elisa ; Maffioli, Francesco
European Journal of Engineering Education.  30 (2005)  4 - p. 409-416 , 2005
Link: https://doi.org/10.1080/..
 
1-15