Capacitated Network Design—Polyhedral Structure and Computation
From MaRDI portal
Publication:5690264
DOI10.1287/ijoc.8.3.243zbMath0871.90031OpenAlexW1993734840MaRDI QIDQ5690264
Oktay Günlük, Bienstock, Daniel
Publication date: 15 January 1997
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.8.3.243
branch and boundlower boundcapacity expansioncutting-plane algorithmpolyhedral structurefacet defining inequalitiestelecommunciation network design
Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Mixed integer programming (90C11) Communication networks in operations research (90B18)
Related Items (50)
A genetic algorithm based on relaxation induced neighborhood search in a local branching framework for capacitated multicommodity network design ⋮ The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design ⋮ Single-commodity robust network design with finite and hose demand sets ⋮ The multi-layered network design problem ⋮ Perspective reformulations of mixed integer nonlinear programs with indicator variables ⋮ Unsplittable non-additive capacitated network design using set functions polyhedra ⋮ Network loading problem: valid inequalities from 5- and higher partitions ⋮ A partitioning algorithm for the network loading problem ⋮ Robust network design: Formulations, valid inequalities, and computations ⋮ Affine recourse for the robust network design problem: Between static and dynamic routing ⋮ Benders decomposition approach for the robust network design problem with flow bifurcations ⋮ A polyhedral study of the capacity formulation of the multilayer network design problem ⋮ Chance-Constrained Optimization of Reliable Fixed Broadband Wireless Networks ⋮ New partial aggregations for multicommodity network flow problems: an application to the fixed-charge network design problem ⋮ Multi-period traffic routing in satellite networks ⋮ A note on capacity models for network design ⋮ On modelling non-linear quantity discounts in a supplier selection problem by mixed linear integer optimization ⋮ Valid inequalities and facets for multi‐module survivable network design problem ⋮ On the robustness of potential-based flow networks ⋮ Bidirected and unidirected capacity installation in telecommunication networks. ⋮ Valid inequalities and separation for capacitated fixed charge flow problems ⋮ MIP Neighborhood Search Heuristics for a Capacitated Fixed-Charge Network Design Problem ⋮ Partition inequalities for capacitated survivable network design based on directed \(p\)-cycles ⋮ Metric inequalities and the network loading problem ⋮ Cutting planes in integer and mixed integer programming ⋮ The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs ⋮ Algorithms for the non-bifurcated network design problem ⋮ Bundle-based relaxation methods for multicommodity capacitated fixed charge network design ⋮ Polyhedral structure of the 4-node network design problem ⋮ Description of 2-integer continuous knapsack polyhedra ⋮ Towards optimizing the deployment of optical access networks ⋮ Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design ⋮ An effective logarithmic formulation for piecewise linearization requiring no inequality constraint ⋮ Capacitated multi-layer network design with unsplittable demands: polyhedra and branch-and-cut ⋮ On cut-based inequalities for capacitated network design polyhedra ⋮ Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité ⋮ 0-1 reformulations of the multicommodity capacitated network design problem ⋮ Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems ⋮ A directed cycle-based column-and-cut generation method for capacitated survivable network design ⋮ A local branching heuristic for the capacitated fixed-charge network design problem ⋮ Directed fixed charge multicommodity network design: a cutting plane approach using polar duality ⋮ Capacitated facility location: Separation algorithms and computational experience ⋮ Minimum cost capacity installation for multicommodity network flows ⋮ An exact approach for the multicommodity network optimization problem with a step cost function ⋮ Benders-and-cut algorithm for fixed-charge capacitated network design problem ⋮ Diversification strategies in local search for a nonbifurcated network loading problem ⋮ New modeling approaches for the design of local access transport area networks ⋮ A dynamic programming algorithm for the local access telecommunication network expansion problem ⋮ Sequence independent lifting for mixed integer programs with variable upper bounds ⋮ Lifting for mixed integer programs with variable upper bounds
This page was built for publication: Capacitated Network Design—Polyhedral Structure and Computation
