New formulation and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks (Q2968488)
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: New formulation and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks |
scientific article; zbMATH DE number 6695697
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New formulation and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks |
scientific article; zbMATH DE number 6695697 |
Statements
New formulation and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks (English)
0 references
16 March 2017
0 references
integer programming
0 references
transportation
0 references
traveling salesman
0 references
valid inequalities
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9478658437728882
0 references
0.9299830198287964
0 references
0.9195858240127563
0 references
0.8661090135574341
0 references
