Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem (Q1683126)
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: Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem |
scientific article; zbMATH DE number 6816191
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem |
scientific article; zbMATH DE number 6816191 |
Statements
Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem (English)
0 references
6 December 2017
0 references
traveling salesman problem
0 references
distance constraint
0 references
integer linear programming
0 references
layered graph
0 references
branch-and-cut
0 references
0 references
0 references
0 references
0 references
