The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm (Q847836)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm |
scientific article |
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
