The tree-star problem: a formulation and a branch-and-cut algorithm (Q325465): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.endm.2016.03.038 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: TSPLIB / 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.endm.2016.03.038 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2408068853 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the shortest spanning subtree of a graph and the traveling salesman problem / 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: Reformulations and solution algorithms for the maximum leaf spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong lower bounds for the prize collecting Steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Minimum Connected Dominating Set Problem: Formulation, Valid Inequalities and a Branch-and-Cut Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.ENDM.2016.03.038 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:27, 9 December 2024

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

    Statements

    Identifiers