Network Design Using Cut Inequalities
From MaRDI portal
DOI10.1137/S1052623494279134zbMATH Open0856.90112MaRDI QIDQ4895623FDOQ4895623
Authors: Francisco Barahona 
Publication date: 14 October 1996
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Recommendations
- Polyhedral results for the edge capacity polytope.
- Network loading problem: valid inequalities from 5- and higher partitions
- Modeling and Solving the Two-Facility Capacitated Network Loading Problem
- Exact approaches to the single-source network loading problem
- Bidirected and unidirected capacity installation in telecommunication networks.
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Integer programming (90C10)
Cited In (51)
- Capacitated multi-layer network design with unsplittable demands: polyhedra and branch-and-cut
- A MIP-based approach to solve the prize-collecting local access network design problem
- Benders decomposition for network design covering problems
- A Network Design Problem with Two-Edge Matching Failures
- Diversification strategies in local search for a nonbifurcated network loading problem
- 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
- Benders decomposition approach for the robust network design problem with flow bifurcations
- Valid inequalities and separation for capacitated fixed charge flow problems
- A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation
- On the \(k\)-cut problem
- Exact solution of multicommodity network optimization problems with general step cost functions
- Branch-and-price-and-cut for a service network design and hub location problem
- What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO
- 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
- Canonical dual approach to solving the maximum cut problem
- The multi-commodity one-to-one pickup-and-delivery traveling salesman problem
- Bidirected and unidirected capacity installation in telecommunication networks.
- Routing of uncertain traffic demands
- Robust Metric Inequalities for Network Loading Under Demand Uncertainty
- Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
- Partition inequalities for capacitated survivable network design based on directed \(p\)-cycles
- Exact and heuristic algorithms for the Hamiltonian \(p\)-median problem
- Minimum cost capacity installation for multicommodity network flows
- Benders, metric and cutset inequalities for multicommodity capacitated network design
- Algorithms – ESA 2005
- The transit time constrained fixed charge multi-commodity network design problem
- A capacity scaling heuristic for the multicommodity capacitated network design problem
- Unsplittable non-additive capacitated network design using set functions polyhedra
- The multi-layered network design problem
- Greedy differencing edge-contraction heuristic for the max-cut problem
- A robust optimization model for distribution network design under a mixed integer set of scenarios
- Algorithms for the non-bifurcated network design problem
- A partitioning algorithm for the network loading problem
- 0-1 reformulations of the multicommodity capacitated network design problem
- Cutting planes in integer and mixed integer programming
- Network Models with Unsplittable Node Flows with Application to Unit Train Scheduling
- A survey on Benders decomposition applied to fixed-charge network design problems
- The robust network loading problem with dynamic routing
- Solving a capacitated hub location problem
- Metric inequalities and the network loading problem
- Using mixed-integer programming to solve power grid blackout problems
- Directed fixed charge multicommodity network design: a cutting plane approach using polar duality
- Separating tight metric inequalities by bilevel programming
- On cut-based inequalities for capacitated network design polyhedra
- Polyhedral structure of the 4-node network design problem
- Algorithms for an integer multicommodity network flow problem with node reliability considerations
- Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints
- Exact approaches to the single-source network loading problem
- Approximation algorithms for general one-warehouse multi-retailer systems
This page was built for publication: Network Design Using Cut Inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4895623)
