Unboundedness in reverse convex and concave integer programming
Year of publication: |
2010
|
---|---|
Authors: | Obuchowska, Wiesława T. |
Published in: |
Mathematical methods of operations research. - Berlin : Springer, ISSN 1432-2994, ZDB-ID 1310695-8. - Vol. 72.2010, 2, p. 187-204
|
Subject: | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Ganzzahlige Optimierung | Integer programming |
-
Consistency cuts for Dantzig-Wolfe reformulations
Clausen, Jens Vinther, (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 ...
-
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)
-
On boundedness of (quasi-)convex integer optimization problems
Obuchowska, Wiesława T., (2008)
- More ...