Projecting an extended formulation for mixed-integer covers on bipartite graphs
Year of publication: |
2010
|
---|---|
Authors: | Conforti, Michele ; Wolsey, Laurence A. ; Zambelli, Giacomo |
Published in: |
Mathematics of operations research. - Catonsville, MD : INFORMS, ISSN 0364-765X, ZDB-ID 195683-8. - Vol. 35.2010, 3, p. 603-623
|
Subject: | Graphentheorie | Graph theory | Ganzzahlige Optimierung | Integer programming | Projektmanagement | Project management |
-
Partitioning through projections : strong SDP bounds for large graph partition problems
Meijer, Frank de, (2023)
-
A network simplex method for the budget-constrained minimum cost flow problem
Holzhauser, Michael, (2017)
-
Model for flexibility evaluation in manufacturing network strategic planning
Kemmoe, Sylverin, (2014)
- More ...
-
Projecting an extended formulation for mixed-integer covers on bipartite graphs
CONFORTI, Michele,
-
Projecting an extended formulation for mixed-integer covers on bipartite graphs
CONFORTI, Michele,
-
Projecting an Extended Formulation for Mixed-Integer Covers on Bipartite Graphs
Conforti, Michele, (2010)
- More ...