A branch-and-cut algorithm for the minimum labeling Hamiltonian cycle problem and two variants (Q716345)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-cut algorithm for the minimum labeling Hamiltonian cycle problem and two variants |
scientific article |
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
