Capacitated Network Design—Polyhedral Structure and Computation

DOI10.1287/IJOC.8.3.243zbMATH Open0871.90031OpenAlexW1993734840MaRDI QIDQ5690264FDOQ5690264

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

Recommendations

On capacitated network design cut-set polyhedra
A branch-and-cut algorithm for capacitated network design problems
Capacitated network design with uncertain demand
On cut-based inequalities for capacitated network design polyhedra
Modeling and Solving the Two-Facility Capacitated Network Loading Problem

lower bound branch and bound capacity expansion cutting-plane algorithm polyhedral structure facet defining inequalities telecommunciation network design

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Mixed integer programming (90C11) Communication networks in operations research (90B18)

Cited In (73)

On the robustness of potential-based flow networks
Valid inequalities and facets for multi‐module survivable network design problem
Mathematical formulations for multi-period network design with modular capacity adjustments
Capacitated network design -- multi-commodity flow formulations, cutting planes, and demand uncertainty
Benders-and-cut algorithm for fixed-charge capacitated network design problem
Capacitated facility location: Separation algorithms and computational experience
Capacitated multi-layer network design with unsplittable demands: polyhedra and branch-and-cut
Multiperiod capacity expansion of road networks: Formulation and algorithms
Diversification strategies in local search for a nonbifurcated network loading problem
The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs
Optimal design of capacitated production networks
Design of Capacitated Multicommodity Networks with Multiple Facilities
Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité
The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design
Polyhedral Analysis for the Uncapacitated Hub Location Problem with Modular Arc Capacities
An exact algorithm for the min-cost network containment problem
Capacitated network design with uncertain demand
The convex hull of two core capacitated network design problems
Network design applications of the class of column generation/simplicial decomposition algorithms in convex differentiable optimization
Capacitated facility location/network design problems.
New partial aggregations for multicommodity network flow problems: an application to the fixed-charge network design problem
Benders decomposition approach for the robust network design problem with flow bifurcations
Valid inequalities and separation for capacitated fixed charge flow problems
Chance-constrained optimization of reliable fixed broadband wireless networks
Network flow models for the local access network expansion problem
A dynamic programming algorithm for the local access telecommunication network expansion problem
A directed cycle-based column-and-cut generation method for capacitated survivable network design
Single-commodity robust network design with finite and hose demand sets
A note on capacity models for network design
Bidirected and unidirected capacity installation in telecommunication networks.
A genetic algorithm based on relaxation induced neighborhood search in a local branching framework for capacitated multicommodity network design
Multicommodity network expansion under elastic demands
Lifting for mixed integer programs with variable upper bounds
Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
Network loading problem: valid inequalities from 5- and higher partitions
A cutting plane algorithm for the capacitated connected facility location problem
Perspective reformulations of mixed integer nonlinear programs with indicator variables
Partition inequalities for capacitated survivable network design based on directed \(p\)-cycles
MIP neighborhood search heuristics for a capacitated fixed-charge network design problem
Minimum cost capacity installation for multicommodity network flows
An effective logarithmic formulation for piecewise linearization requiring no inequality constraint
Multi-period traffic routing in satellite networks
Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
Description of 2-integer continuous knapsack polyhedra
Algorithms – ESA 2005
On modelling non-linear quantity discounts in a supplier selection problem by mixed linear integer optimization
An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron
On capacitated network design cut-set polyhedra
Robust network design: formulations, valid inequalities, and computations
Unsplittable non-additive capacitated network design using set functions polyhedra
A polyhedral study of the capacity formulation of the multilayer network design problem
A local branching heuristic for the capacitated fixed-charge network design problem
The multi-layered network design problem
Algorithms for the non-bifurcated network design problem
Solving network design problems via iterative aggregation
A characterization of the uncapacitated network design polytope
A partitioning algorithm for the network loading problem
Core-edge design of storage area networks-a single-edge formulation with problem-specific cuts
0-1 reformulations of the multicommodity capacitated network design problem
Sequence independent lifting for mixed integer programs with variable upper bounds
Cutting planes in integer and mixed integer programming
An exact approach for the multicommodity network optimization problem with a step cost function
Towards optimizing the deployment of optical access networks
Metric inequalities and the network loading problem
New modeling approaches for the design of local access transport area networks
Directed fixed charge multicommodity network design: a cutting plane approach using polar duality
Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems
Affine recourse for the robust network design problem: between static and dynamic routing
On cut-based inequalities for capacitated network design polyhedra
Title not available (Why is that?)
Polyhedral structure of the 4-node network design problem
Network design problem with cut constraints
Generalized network design polyhedra

This page was built for publication: Capacitated Network Design—Polyhedral Structure and Computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5690264)