Constrained shortest path tour problem: branch-and-price algorithm (Q2147106)
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: Constrained shortest path tour problem: branch-and-price algorithm |
scientific article; zbMATH DE number 7546554
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Constrained shortest path tour problem: branch-and-price algorithm |
scientific article; zbMATH DE number 7546554 |
Statements
Constrained shortest path tour problem: branch-and-price algorithm (English)
0 references
22 June 2022
0 references
shortest path tour
0 references
complexity
0 references
integer linear programming
0 references
integral polytope
0 references
column generation
0 references
Dantzig-Wolfe decomposition
0 references
0 references
0 references
0.8929535746574402
0 references
0.8911691904067993
0 references
0.8237146139144897
0 references
0.8105322122573853
0 references
0.8001708984375
0 references
