The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm (Q643033): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: TSPLIB / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SteinLib / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2011.01.015 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2062160763 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4461905 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Capacitated <i>m</i>-Ring-Star Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Circuit Polytope: Facets / 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: Solving Steiner tree problems in graphs to optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ring Star Problem: Polyhedral analysis and exact algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3836524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing a Ring-Based Private Line Telecommunication Network Using Tabu Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dual ascent approach for steiner tree problems on a directed graph / rank
 
Normal rank

Latest revision as of 14:55, 4 July 2024

scientific article
Language Label Description Also known as
English
The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm
scientific article

    Statements

    The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm (English)
    0 references
    27 October 2011
    0 references
    ring-star problem
    0 references
    caterpillar trees
    0 references
    integer programming
    0 references
    branch-and-cut algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers