Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound

DOI10.1287/opre.46.2.247zbMath0979.90060MaRDI QIDQ2770085

Kaj Holmberg, Johan Hellstrand

Publication date: 7 February 2002

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.46.2.247

zbMATH Keywords

network design; transportation networks; Lagrangean heuristic; computational tests; linear mixed-integer programming; multicommodity minimal cost network flow

Mathematics Subject Classification ID

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90B35: Deterministic scheduling theory in operations research

90C59: Approximation methods and heuristics in mathematical programming

90B10: Deterministic network models in operations research

Related Items

Scatter search for network design problem, Traffic engineering of tunnel-based networks with class specific diversity requirements, Hybrid meta-heuristic algorithms for solving network design problem, A Lagrangean heuristic for the facility location problem with staircase costs, Service network design in freight transportation, Lagrangian based heuristics for the multicommodity network flow problem with fixed costs on paths, Network design and flow problems with cross-arc costs, Memetic algorithms