Integer programming formulations for the elementary shortest path problem
Year of publication: |
2016
|
---|---|
Authors: | Taccari, Leonardo |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 252.2016, 1 (1.7.), p. 122-130
|
Subject: | Integer programming | Elementary shortest path | Branch-and-cut | Extended formulations | Subtour elimination constraints | Ganzzahlige Optimierung | Graphentheorie | Graph theory |
-
Layered graph approaches for combinatorial optimization problems
Gouveia, Luis, (2019)
-
Extended formulation for hop constrained distribution network configuration problems
De Boeck, Jérôme, (2018)
-
The total matching polytope of complete bipartite graphs
Faenza, Yuri, (2024)
- More ...
-
A detailed MILP optimization model for combined cooling, heat and power system operation planning
Bischi, Aldo, (2014)
-
Discrete optimization methods to fit piecewise affine models to data points
Amaldi, Edoardo, (2016)
-
Exploiting sets of independent moves in VRP
Bianconcini, Tommaso, (2018)
- More ...