Source sink flows with capacity installation in batches

DOI10.1016/S0166-218X(98)00024-9zbMath0908.90117MaRDI QIDQ1130180

Sunil Chopra, Itzhak Gilboa, S. Trilochan Sastry

Publication date: 20 August 1998

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

heuristicmin cost flowstrong valid inequalities

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic network models in operations research (90B10)

Related Items (16)

Exact approaches to the single-source network loading problem ⋮ On dependent randomized rounding algorithms ⋮ Approximation Algorithms for Buy-at-Bulk Geometric Network Design ⋮ A partitioning algorithm for the network loading problem ⋮ Robust network design: Formulations, valid inequalities, and computations ⋮ APPROXIMATION ALGORITHMS FOR BUY-AT-BULK GEOMETRIC NETWORK DESIGN ⋮ Partition inequalities for capacitated survivable network design based on directed \(p\)-cycles ⋮ Metric inequalities and the network loading problem ⋮ The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs ⋮ Towards optimizing the deployment of optical access networks ⋮ 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 ⋮ 0-1 reformulations of the multicommodity capacitated network design problem ⋮ Graphs and Algorithms in Communication Networks on Seven League Boots ⋮ Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimum cost capacity installation for multicommodity network flows
• Facets and algorithms for capacitated lot sizing
• Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
• Modeling and Solving the Two-Facility Capacitated Network Loading Problem
• Shortest paths, single origin‐destination network design, and associated polyhedra

This page was built for publication: Source sink flows with capacity installation in batches