The Steiner tree problem with delays: a compact formulation and reduction procedures (Q496653): 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.dam.2011.07.008 / 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.07.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2146853131 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4426341 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problem reduction methods and a tree generation algorithm for the steiner network problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Steiner Tree Problem on a Graph Using Branch and Cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints / 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: Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicommodity flow models for spanning trees with hop constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling and solving the rooted distance-constrained minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dual algorithm for the constrained shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner tree problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The shortest route problem with constraints / 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: Q3048571 / 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: Q4117605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of combinatorial optimization problems in multicast routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of Steiner tree relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A distributed dual ascent algorithm for the Hop-constrained Steiner tree problem / 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
Property / cites work
 
Property / cites work: On Tightening the Relaxations of Miller-Tucker-Zemlin Formulations for Asymmetric Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3874241 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preprocessing Steiner problems from VLSI layout / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2011.07.008 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:24, 9 December 2024

scientific article
Language Label Description Also known as
English
The Steiner tree problem with delays: a compact formulation and reduction procedures
scientific article

    Statements

    The Steiner tree problem with delays: a compact formulation and reduction procedures (English)
    0 references
    0 references
    0 references
    0 references
    22 September 2015
    0 references
    Steiner tree problem
    0 references
    MTZ subtour elimination constraints
    0 references
    reduction techniques
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers