A scaleable projection-based branch-and-cut algorithm for the \(p\)-center problem (Q2673558)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7539482
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A scaleable projection-based branch-and-cut algorithm for the \(p\)-center problem |
scientific article; zbMATH DE number 7539482 |
Statements
A scaleable projection-based branch-and-cut algorithm for the \(p\)-center problem (English)
0 references
10 June 2022
0 references
location
0 references
\(p\)-center problem
0 references
integer programming formulation
0 references
lifting
0 references
min-max objective
0 references
0 references
0 references
0.8520193099975586
0 references
0.8269050121307373
0 references
0.804510772228241
0 references
0.7897937297821045
0 references
