Algorithms and extended formulations for one and two facility network design

DOI10.1007/3-540-61310-2_4zbMath1415.90134OpenAlexW1803205917MaRDI QIDQ4645912

Sunil Chopra, Itzhak Gilboa, S. Trilochan Sastry

Publication date: 11 January 2019

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61310-2_4

zbMATH Keywords

polynomial timenetwork design problemminimum coverextended formulationshort path

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Unnamed Item
• Unnamed Item
• Minimum cost capacity installation for multicommodity network flows
• 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