Algorithms – ESA 2005

DOI10.1007/11561071zbMath1162.90576OpenAlexW2501059503MaRDI QIDQ5475818

Larissa Timajev, Georg Kliewer

Publication date: 27 June 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11561071

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10)

Related Items (14)

The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design ⋮ Scalable algorithms for designing \(\mathrm{CO}_2\) capture and storage infrastructure ⋮ A cutting plane algorithm for the capacitated connected facility location problem ⋮ The transit time constrained fixed charge multi-commodity network design problem ⋮ Revisiting Lagrangian relaxation for network design ⋮ Benders, metric and cutset inequalities for multicommodity capacitated network design ⋮ Exact algorithms for the vertex separator problem in graphs ⋮ Bundle methods for sum-functions with ``easy components: applications to multicommodity network design ⋮ Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design ⋮ Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design ⋮ Application of Benders decomposition method in solution of a fixed-charge multicommodity network design problem avoiding congestion ⋮ 0-1 reformulations of the multicommodity capacitated network design problem ⋮ Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design ⋮ Directed fixed charge multicommodity network design: a cutting plane approach using polar duality

This page was built for publication: Algorithms – ESA 2005