The Ring Star Problem: Polyhedral analysis and exact algorithm (Q4474293): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1002/net.10114 / rank
Normal rank
 
Property / cites work
 
Property / cites work: On the \(p\)-median polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Circuit Polytope: Facets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Location-Allocation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The median tour and maximal covering tour problems: Formulations and heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Covering Tour Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3147665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood tabu search and its application to the median cycle problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the facial structure of set packing polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing a Ring-Based Private Line Telecommunication Network Using Tabu Search / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1002/NET.10114 / rank
 
Normal rank

Latest revision as of 04:02, 30 December 2024

scientific article; zbMATH DE number 2081225
Language Label Description Also known as
English
The Ring Star Problem: Polyhedral analysis and exact algorithm
scientific article; zbMATH DE number 2081225

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references