Integer programming formulations for the elementary shortest path problem (Q322844)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Integer programming formulations for the elementary shortest path problem |
scientific article; zbMATH DE number 6636203
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Integer programming formulations for the elementary shortest path problem |
scientific article; zbMATH DE number 6636203 |
Statements
Integer programming formulations for the elementary shortest path problem (English)
0 references
7 October 2016
0 references
integer programming
0 references
elementary shortest path
0 references
branch-and-cut
0 references
extended formulations
0 references
subtour elimination constraints
0 references
0 references
0 references
0 references
0 references
0.902782678604126
0 references
0.8307866454124451
0 references
0.8169219493865967
0 references
0.797606885433197
0 references
