Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems (Q3404461): Difference between revisions

From MaRDI portal
Added link to MaRDI 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: SCIP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SNDlib / 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.1007/978-3-642-02250-0_3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1617772575 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5241193 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SCIP: solving constraint integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cost-efficient network synthesis from leased lines / rank
 
Normal rank
Property / cites work
 
Property / cites work: On capacitated network design cut-set polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum cost capacity installation for multicommodity network flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated Network Design—Polyhedral Structure and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the spanning tree polyhedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: Source sink flows with capacity installation in batches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing Through Virtual Paths in Layered Telecommunication Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Traffic-Grooming Algorithm for Wavelength-Routed Optical Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved Benders decomposition applied to a multi-layer network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for capacitated network design problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic approach for combined equipment-planning and routing in multi-layer SDH/WDM networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multi-layered network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight LP‐based lower bounds for wavelength conversion in optical networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest paths, single origin‐destination network design, and associated polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aggregation and Mixed Integer Rounding to Solve MIPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cut-based inequalities for capacitated network design polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Designing WDM optical networks using branch-and-price / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preprocessing and Probing Techniques for Mixed Integer Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4254875 / rank
 
Normal rank

Latest revision as of 10:29, 2 July 2024

scientific article
Language Label Description Also known as
English
Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems
scientific article

    Statements

    Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    9 February 2010
    0 references
    telecommunication networks
    0 references
    multilayer network design
    0 references
    preprocessing
    0 references
    integer linear programming
    0 references
    cutting planes
    0 references
    MIP-based heuristics
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers