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 | Mathematische Optimierung | Mathematical programming | Ganzzahlige Optimierung | Integer programming |
-
Embedding formulations and complexity for unions of polyhedra
Vielma, Juan Pablo, (2018)
-
Optimal product line pricing in the presence of budget-constrained consumers
Mayer, Stefan, (2016)
-
A column generation approach for aircraft sequencing problems : a computational study
Ghoniem, Ahmed, (2015)
- More ...
-
Tilk, Christian, (2019)
-
The split delivery vehicle routing problem with time windows and customer inconvenience constraints
Bianchessi, Nicola, (2019)
-
Branch-and-price-and-cut for a service network design and hub location problem
Rothenbächer, Ann-Kathrin, (2016)
- More ...