Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound
From MaRDI portal
Publication:2770085
DOI10.1287/opre.46.2.247zbMath0979.90060OpenAlexW2123550810MaRDI QIDQ2770085
Johan Hellstrand, Kaj Holmberg
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
network designtransportation networksLagrangean heuristiccomputational testslinear mixed-integer programmingmulticommodity minimal cost network flow
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)
Related Items
A branch and bound algorithm for bi-level discrete network design problem ⋮ The weighted uncapacitated planned maintenance problem: complexity and polyhedral properties ⋮ Traffic engineering of tunnel-based networks with class specific diversity requirements ⋮ Hybrid meta-heuristic algorithms for solving network design problem ⋮ Revisiting Lagrangian relaxation for network design ⋮ An exact algorithm for the service network design problem with hub capacity constraints ⋮ Use of Lagrangian decomposition in supply chain planning ⋮ Lagrangian based heuristics for the multicommodity network flow problem with fixed costs on paths ⋮ A Unified Approach to Mixed-Integer Optimization Problems With Logical Constraints ⋮ Network design and flow problems with cross-arc costs ⋮ Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design ⋮ On the use of guided design search for discovering significant decision variables in the fixed‐charge capacitated multicommodity network design problem ⋮ A Benders decomposition approach for a distribution network design problem with consolidation and capacity considerations ⋮ The \(k\)-Cardinality Tree Problem: reformulations and Lagrangian relaxation ⋮ Lower bounding techniques for the degree-constrained network design problem ⋮ Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints ⋮ A Lagrangean heuristic for the facility location problem with staircase costs ⋮ An effective linear approximation method for separable programming problems ⋮ Heuristics for the rural postman problem ⋮ Service network design in freight transportation ⋮ Memetic algorithms ⋮ Scatter search for network design problem
