Solving elementary shortest-path problems as mixed-integer programs
Year of publication: |
2014
|
---|---|
Authors: | Drexl, Michael ; Irnich, Stefan |
Published in: |
OR spectrum : quantitative approaches in management. - Berlin : Springer, ISSN 0171-6468, ZDB-ID 2073885-7. - Vol. 36.2014, 2, p. 281-296
|
Subject: | Elementary shortest-path problem | Negative cycles | Mixed-integer programming | Theorie | Theory | Ganzzahlige Optimierung | Integer programming | Mathematische Optimierung | Mathematical programming |
-
Embedding formulations and complexity for unions of polyhedra
Vielma, Juan Pablo, (2018)
-
Optimising lot sizing with nonlinear production rates in a multi-product single-machine environment
Neidigh, Robert O., (2013)
-
Optimising lot sizing with nonlinear production rates in a multi-product multi-machine environment
Neidigh, Robert O., (2017)
- More ...
-
Tilk, Christian, (2019)
-
Branch-and-price-and-cut for a service network design and hub location problem
Rothenbächer, Ann-Kathrin, (2016)
-
Branch-and-price-and-cut for the active-passive vehicle-routing problem
Tilk, Christian, (2018)
- More ...