A dual heuristic for mixed integer programming
Year of publication: |
2015
|
---|---|
Authors: | Li, Yaxian ; Ergun, Özlem ; Nemhauser, George L. |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 43.2015, 4, p. 411-417
|
Subject: | Dual heuristic | Branch-and-bound | Knapsack | Relaxations | Ganzzahlige Optimierung | Integer programming | Heuristik | Heuristics | Theorie | Theory | Mathematische Optimierung | Mathematical programming |
-
Thiongane, Babacar, (2015)
-
Algorithmic approaches to the multiple knapsack assignment problem
Martello, Silvano, (2019)
-
Adaptive perturbed neighbourhood search for the expanding capacity multiple-choice knapsack problem
Sbihi, A., (2013)
- More ...
-
Pricing for production and delivery flexibility in single-item lot-sizing
Li, Yaxian, (2012)
-
Solving the spread curve puzzle
Fridson, Martin S., (2018)
-
Improving Humanitarian Operations through Technology-Enabled Collaboration
Ergun, Özlem, (2014)
- More ...