Capacitated Network Design—Polyhedral Structure and Computation
From MaRDI portal
Publication:5690264
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
Cited in
(73)- 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
- The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs
- Diversification strategies in local search for a nonbifurcated network loading problem
- Optimal design of capacitated production networks
- Design of Capacitated Multicommodity Networks with Multiple Facilities
- The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design
- Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité
- The convex hull of two core capacitated network design problems
- An exact algorithm for the min-cost network containment problem
- Polyhedral Analysis for the Uncapacitated Hub Location Problem with Modular Arc Capacities
- Capacitated network design with uncertain demand
- Network design applications of the class of column generation/simplicial decomposition algorithms in convex differentiable optimization
- New partial aggregations for multicommodity network flow problems: an application to the fixed-charge network design problem
- Valid inequalities and separation for capacitated fixed charge flow problems
- Capacitated facility location/network design problems.
- Benders decomposition approach for the robust network design problem with flow bifurcations
- Network flow models for the local access network expansion problem
- Chance-constrained optimization of reliable fixed broadband wireless networks
- A dynamic programming algorithm for the local access telecommunication network expansion problem
- Single-commodity robust network design with finite and hose demand sets
- A directed cycle-based column-and-cut generation method for capacitated survivable network design
- On the robustness of potential-based flow networks
- Bidirected and unidirected capacity installation in telecommunication networks.
- A note on capacity models for network design
- 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
- Valid inequalities and facets for multi‐module survivable network design problem
- Network loading problem: valid inequalities from 5- and higher partitions
- Partition inequalities for capacitated survivable network design based on directed p-cycles
- Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
- A cutting plane algorithm for the capacitated connected facility location problem
- Perspective reformulations of mixed integer nonlinear programs with indicator variables
- Mathematical formulations for multi-period network design with modular capacity adjustments
- Minimum cost capacity installation for multicommodity network flows
- MIP neighborhood search heuristics for a capacitated fixed-charge network design problem
- 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
- On modelling non-linear quantity discounts in a supplier selection problem by mixed linear integer optimization
- Description of 2-integer continuous knapsack polyhedra
- Algorithms – ESA 2005
- Capacitated network design -- multi-commodity flow formulations, cutting planes, and demand uncertainty
- An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron
- On capacitated network design cut-set polyhedra
- Unsplittable non-additive capacitated network design using set functions polyhedra
- A local branching heuristic for the capacitated fixed-charge network design problem
- Robust network design: formulations, valid inequalities, and computations
- A polyhedral study of the capacity formulation of the multilayer network design problem
- The multi-layered network design problem
- Algorithms for the non-bifurcated network design problem
- A characterization of the uncapacitated network design polytope
- Solving network design problems via iterative aggregation
- 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
- Cutting planes in integer and mixed integer programming
- A partitioning algorithm for the network loading problem
- Sequence independent lifting for mixed integer programs with variable upper bounds
- 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
- scientific article; zbMATH DE number 2132072 (Why is no real title available?)
- 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)
