A scaleable projection-based branch-and-cut algorithm for the \(p\)-center problem (Q2673558): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q113875423, #quickstatements; #temporary_batch_1707252663060 |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: TSPLIB / rank | |||
Normal rank | |||
Revision as of 23:55, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A scaleable projection-based branch-and-cut algorithm for the \(p\)-center problem |
scientific article |
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
