The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach (Q336445)
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: The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach |
scientific article; zbMATH DE number 6650453
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach |
scientific article; zbMATH DE number 6650453 |
Statements
The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach (English)
0 references
10 November 2016
0 references
traveling purchaser problem
0 references
pickup and delivery
0 references
last-in-first-out
0 references
branch-and-cut
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.94648314
0 references
0.9269449
0 references
0.92235863
0 references
0.91642463
0 references
0.90210146
0 references
0.8994914
0 references
0.8944477
0 references
0.8917199
0 references
