Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs (Q2384394)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5194352
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs |
scientific article; zbMATH DE number 5194352 |
Statements
Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs (English)
0 references
21 September 2007
0 references
combinatorial optimisation
0 references
travelling salesman
0 references
polyhedral analysis
0 references
Lagrangean relaxation
0 references
branch-and-bound method
0 references
0 references
0 references
0 references
0 references
0.9073203206062316
0 references
0.8828504085540771
0 references
0.8064650893211365
0 references
0.7901309132575989
0 references
0.7901309132575989
0 references
