Revisiting the Hamiltonian \(p\)-median problem: a new formulation on directed graphs and a branch-and-cut algorithm (Q1728472)
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: Revisiting the Hamiltonian p-median problem: a new formulation on directed graphs and a branch-and-cut algorithm |
scientific article; zbMATH DE number 7029250
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Revisiting the Hamiltonian \(p\)-median problem: a new formulation on directed graphs and a branch-and-cut algorithm |
scientific article; zbMATH DE number 7029250 |
Statements
Revisiting the Hamiltonian \(p\)-median problem: a new formulation on directed graphs and a branch-and-cut algorithm (English)
0 references
25 February 2019
0 references
combinatorial optimization
0 references
Hamiltonian \(p\)-median
0 references
multi-cut inequalities
0 references
multi-depot routing
0 references
branch-and-cut algorithm
0 references
0 references
0.8615564107894897
0 references
0.8538854718208313
0 references
0.8529054522514343
0 references
0.8491944074630737
0 references
0.8404630422592163
0 references
