Exact solutions to the double travelling salesman problem with multiple stacks (Q3064039): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Path inequalities for the vehicle routing problem with time windows / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches / rank | |||
Normal rank | |||
Latest revision as of 13:35, 3 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Exact solutions to the double travelling salesman problem with multiple stacks |
scientific article |
Statements
Exact solutions to the double travelling salesman problem with multiple stacks (English)
0 references
20 December 2010
0 references
traveling salesman problem
0 references
pickup and delivery
0 references
loading
0 references
LIFO
0 references
branch and cut
0 references
0 references
0 references
