Network Design Using Cut Inequalities
From MaRDI portal
Publication:4895623
DOI10.1137/S1052623494279134zbMath0856.90112MaRDI QIDQ4895623
Publication date: 14 October 1996
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Integer programming (90C10) Combinatorial optimization (90C27)
Related Items
The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design, Exact approaches to the single-source network loading problem, Routing of uncertain traffic demands, Single-commodity robust network design with finite and hose demand sets, The multi-layered network design problem, A capacity scaling heuristic for the multicommodity capacitated network design problem, The robust network loading problem with dynamic routing, Robust Metric Inequalities for Network Loading Under Demand Uncertainty, Exact and heuristic algorithms for the Hamiltonian \(p\)-median problem, Solving a capacitated hub location problem, Approximation algorithms for general one-warehouse multi-retailer systems, Unsplittable non-additive capacitated network design using set functions polyhedra, Benders decomposition approach for the robust network design problem with flow bifurcations, A robust optimization model for distribution network design under a mixed integer set of scenarios, The transit time constrained fixed charge multi-commodity network design problem, Benders decomposition for network design covering problems, Separating tight metric inequalities by bilevel programming, Benders, metric and cutset inequalities for multicommodity capacitated network design, Bidirected and unidirected capacity installation in telecommunication networks., Network Models with Unsplittable Node Flows with Application to Unit Train Scheduling, Valid inequalities and separation for capacitated fixed charge flow problems, What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO, On the \(k\)-cut problem, A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation, Partition inequalities for capacitated survivable network design based on directed \(p\)-cycles, Metric inequalities and the network loading problem, Using mixed-integer programming to solve power grid blackout problems, Algorithms for an integer multicommodity network flow problem with node reliability considerations, Branch-and-price-and-cut for a service network design and hub location problem, Canonical dual approach to solving the maximum cut problem, A MIP-based approach to solve the prize-collecting local access network design problem, Cutting planes in integer and mixed integer programming, A survey on Benders decomposition applied to fixed-charge network design problems, Algorithms for the non-bifurcated network design problem, Polyhedral structure of the 4-node network design problem, Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design, Capacitated multi-layer network design with unsplittable demands: polyhedra and branch-and-cut, On cut-based inequalities for capacitated network design polyhedra, Greedy differencing edge-contraction heuristic for the max-cut problem, Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité, 0-1 reformulations of the multicommodity capacitated network design problem, A directed cycle-based column-and-cut generation method for capacitated survivable network design, Directed fixed charge multicommodity network design: a cutting plane approach using polar duality, Minimum cost capacity installation for multicommodity network flows, The multi-commodity one-to-one pickup-and-delivery traveling salesman problem, A Network Design Problem with Two-Edge Matching Failures, Diversification strategies in local search for a nonbifurcated network loading problem, Exact solution of multicommodity network optimization problems with general step cost functions, Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints
