scientific article; zbMATH DE number 1947445
From MaRDI portal
Publication:4411416
zbMath1040.90004MaRDI QIDQ4411416
Achim Koberstein, Georg Kliewer, Meinolf Sellmann
Publication date: 8 July 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2461/24610845.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10)
Related Items (10)
Constraint programming and operations research ⋮ The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design ⋮ A cutting plane algorithm for the capacitated connected facility location problem ⋮ Revisiting Lagrangian relaxation for network design ⋮ Benders, metric and cutset inequalities for multicommodity capacitated network design ⋮ Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design ⋮ Alternating control tree search for knapsack/covering problems ⋮ Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design ⋮ 0-1 reformulations of the multicommodity capacitated network design problem ⋮ Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design
This page was built for publication:
