Spherical cuts for integer programming problems
Year of publication: |
2008
|
---|---|
Authors: | Liberti, Leo |
Published in: |
International transactions in operational research : ITOR ; a journal of the International Federation of Operational Research Societies (IFORS). - Oxford : Wiley, ISSN 0969-6016, ZDB-ID 1213721-2. - Vol. 15.2008, 3, p. 283-294
|
Subject: | Ganzzahlige Optimierung | Integer programming | Theorie | Theory |
-
Consistency cuts for Dantzig-Wolfe reformulations
Lusby, Richard, (2022)
-
Lagrangian relaxation based heuristic for an integrated production and maintenance planning problem
Alaoui-Selsouli, M., (2012)
-
An arc flow-based optimization approach for the two-stage guillotine strip cutting problem
Mrad, Mehdi, (2015)
- More ...
-
Shortest paths on dynamic graphs
Nannicini, Giacomo, (2008)
-
Molecular distance geometry methods : from continuous to discrete
Liberti, Leo, (2011)
-
A branch-and-prune algorithm for the Molecular Distance Geometry Problem
Liberti, Leo, (2008)
- More ...