Strength of Three MIP Formulations for the Prize Collecting Steiner Tree Problem with a Quota Constraint (Q2883603): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
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.endm.2010.05.063 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2067501168 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the prize collecting traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic expedients for the prize collecting Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952698 / 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: An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming Formulation of Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 05:24, 5 July 2024

scientific article
Language Label Description Also known as
English
Strength of Three MIP Formulations for the Prize Collecting Steiner Tree Problem with a Quota Constraint
scientific article

    Statements

    Strength of Three MIP Formulations for the Prize Collecting Steiner Tree Problem with a Quota Constraint (English)
    0 references
    0 references
    0 references
    0 references
    13 May 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    Steiner tree
    0 references
    MTZ subtour elimination constraints
    0 references
    reformulation-linearization technique
    0 references
    mixed integer programming
    0 references
    0 references