The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm (Q847836)
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 salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm |
scientific article; zbMATH DE number 5673351
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm |
scientific article; zbMATH DE number 5673351 |
Statements
The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm (English)
0 references
19 February 2010
0 references
Precedence relationships
0 references
Valid inequalities
0 references
Separation procedures
0 references
0 references
0 references
0.8879088163375854
0 references
0.8814331889152527
0 references
0.8790947198867798
0 references
0.8705037236213684
0 references
