A branch-and-cut algorithm for the capacitated profitable tour problem (Q2339836)
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: A branch-and-cut algorithm for the capacitated profitable tour problem |
scientific article; zbMATH DE number 6423622
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-cut algorithm for the capacitated profitable tour problem |
scientific article; zbMATH DE number 6423622 |
Statements
A branch-and-cut algorithm for the capacitated profitable tour problem (English)
0 references
9 April 2015
0 references
branch-and-cut algorithm
0 references
valid inequalities
0 references
profitable tour problem
0 references
capacitated shortest path problem
0 references
traveling salesman problem
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8120112419128418
0 references
0.8076955080032349
0 references
0.8039064407348633
0 references
0.7946687936782837
0 references
0.7932689785957336
0 references
