On boundedness of (quasi-)convex integer optimization problems
Year of publication: |
2008
|
---|---|
Authors: | Obuchowska, Wiesława T. |
Published in: |
Mathematical methods of operations research. - Berlin : Springer, ISSN 1432-2994, ZDB-ID 1310695-8. - Vol. 68.2008, 3, p. 445-467
|
Subject: | Ganzzahlige Optimierung | Integer programming | Algorithmus | Algorithm | Theorie | Theory |
-
Consistency cuts for Dantzig-Wolfe reformulations
Lusby, Richard, (2022)
-
Çanakoğlu, Ethem, (2021)
-
Variable fixing for two-arc sequences in branch-price-and-cut algorithms on path-based models
Desaulniers, Guy, (2020)
- More ...
-
Unboundedness in reverse convex and concave integer programming
Obuchowska, Wiesława T., (2010)
-
Feasibility in reverse convex mixed-integer programming
Obuchowska, Wiesława T., (2012)
-
Feasible partition problem in reverse convex and convex mixed-integer programming
Obuchowska, Wiesława T., (2014)
- More ...