On cut-based inequalities for capacitated network design polyhedra

DOI10.1002/NET.20395zbMath1207.90023OpenAlexW2013920518MaRDI QIDQ3082603

Sebastian Orlowski, Christian Raack, Arie M. C. A. Koster, Roland Wessäly

Publication date: 16 March 2011

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20395

zbMATH Keywords

integer programmingcapacitated network designcut residual capacity inequalitiescutset polyhedraflow-cutset inequalitiesmixed-integer rounding SNDlib

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Integer programming (90C10) Deterministic network models in operations research (90B10)

Related Items (31)

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 robust network loading problem with dynamic routing ⋮ Unsplittable non-additive capacitated network design using set functions polyhedra ⋮ Network loading problem: valid inequalities from 5- and higher partitions ⋮ 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 ⋮ Chance-Constrained Optimization of Reliable Fixed Broadband Wireless Networks ⋮ A robust optimization model for distribution network design under a mixed integer set of scenarios ⋮ New partial aggregations for multicommodity network flow problems: an application to the fixed-charge network design problem ⋮ A note on capacity models for network design ⋮ Affine routing for robust network design ⋮ Steiner tree packing revisited ⋮ Separating tight metric inequalities by bilevel programming ⋮ Design of survivable wireless backhaul networks with reliability considerations ⋮ Valid inequalities and facets for multi‐module survivable network design problem ⋮ Network Models with Unsplittable Node Flows with Application to Unit Train Scheduling ⋮ Exact Approaches for Designing Multifacility Buy-at-Bulk Networks ⋮ MIP Neighborhood Search Heuristics for a Capacitated Fixed-Charge Network Design Problem ⋮ Multi-commodity variable upper bound flow models ⋮ Proximity search for 0--1 mixed-integer convex programming ⋮ On the approximability of robust network design ⋮ The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs ⋮ Towards optimizing the deployment of optical access networks ⋮ 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 ⋮ An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron ⋮ Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems ⋮ An exact approach for the multicommodity network optimization problem with a step cost function

Uses Software

• SNDlib
• SCIP

Cites Work

• Unnamed Item
• Unnamed Item
• The convex hull of two core capacitated network design problems
• Valid inequalities for mixed 0-1 programs
• Source sink flows with capacity installation in batches
• Minimum cost capacity installation for multicommodity network flows
• The complementary class of generalized flow cover inequalities
• On the facets of the mixed-integer knapsack polyhedron
• Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
• On splittable and unsplittable flow capacitated network design arc-set polyhedra.
• Polyhedral results for the edge capacity polytope.
• A branch-and-cut algorithm for capacitated network design problems
• A recursive procedure to generate all cuts for 0-1 mixed integer programs
• On capacitated network design cut-set polyhedra
• Metric inequalities and the network loading problem
• On cut-based inequalities for capacitated network design polyhedra
• Aggregation and Mixed Integer Rounding to Solve MIPs
• Valid Linear Inequalities for Fixed Charge Problems
• Modeling and Solving the Two-Facility Capacitated Network Loading Problem
• Network Design Using Cut Inequalities
• Shortest paths, single origin‐destination network design, and associated polyhedra
• k-Partition-based facets of the network design problem
• Capacitated Network Design—Polyhedral Structure and Computation
• Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
• Flow pack facets of the single node fixed-charge flow polytope

This page was built for publication: On cut-based inequalities for capacitated network design polyhedra