Benders decomposition approach for the robust network design problem with flow bifurcations (Q5326799): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(5 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1002/net.21486 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: SNDlib / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MAXFLOW / 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.1002/net.21486 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2153513520 / 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: Metric inequalities and the network loading problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network Design Using Cut Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust solutions of linear programming problems contaminated with uncertain data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning procedures for solving mixed-variables programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust linear optimization under general norms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and network flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Price of Robustness / 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: An integrated model for logistics network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benders, metric and cutset inequalities for multicommodity capacitated network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on Benders decomposition applied to fixed-charge network design problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the selection of Benders' cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solution of multicommodity network optimization problems with general step cost functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Electricity Distribution Planning Model: A Network Design Approach For Solving The Master Problem Of The Benders Decomposition Method. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicommodity Distribution System Design by Benders Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting plane algorithms for robust conic convex optimization problems / 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 robustness approach to uncapacitated network design problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multi-layered network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling and Solving the Two-Facility Capacitated Network Loading Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tailoring Benders decomposition for uncapacitated network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal solution of the discrete cost multicommodity network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust capacity expansion of network flows / 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: Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benders-and-cut algorithm for fixed-charge capacitated network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benders decomposition with alternative multiple cuts for a multi-product closed-loop supply chain network design model / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1002/NET.21486 / rank
 
Normal rank

Latest revision as of 16:42, 30 December 2024

scientific article; zbMATH DE number 6195694
Language Label Description Also known as
English
Benders decomposition approach for the robust network design problem with flow bifurcations
scientific article; zbMATH DE number 6195694

    Statements

    Benders decomposition approach for the robust network design problem with flow bifurcations (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    6 August 2013
    0 references
    network design
    0 references
    integer programming
    0 references
    Benders decomposition
    0 references
    robust optimization
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references