Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs (Q2384394): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 18:51, 2 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs |
scientific article |
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