A branch-and-cut algorithm for the minimum labeling Hamiltonian cycle problem and two variants (Q716345)
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 minimum labeling Hamiltonian cycle problem and two variants |
scientific article; zbMATH DE number 5882216
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-cut algorithm for the minimum labeling Hamiltonian cycle problem and two variants |
scientific article; zbMATH DE number 5882216 |
Statements
A branch-and-cut algorithm for the minimum labeling Hamiltonian cycle problem and two variants (English)
0 references
28 April 2011
0 references
minimum labeling problem
0 references
traveling salesman problem
0 references
branch-and-cut
0 references
0.9224757
0 references
0.8776306
0 references
0.87047434
0 references
0.86736554
0 references
0.86580557
0 references
0.8614942
0 references
