Revisiting Lagrangian relaxation for network design

DOI10.1016/j.dam.2018.07.003zbMath1415.90011OpenAlexW2887687022WikidataQ129440055 ScholiaQ129440055MaRDI QIDQ2414466

Bernard Gendron

Publication date: 17 May 2019

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2018.07.003

zbMATH Keywords

Lagrangian relaxationnetwork designcapacitated facility locationmulticommodity capacitated network design

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Numerical methods of relaxation type (49M20)

Related Items

Branch‐and‐price for energy optimization in multi‐hop wireless sensor networks ⋮ Directed fixed charge multicommodity network design: a cutting plane approach using polar duality

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Benders decomposition without separability: a computational study for capacitated facility location problems
• Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem
• A stabilized structured Dantzig-Wolfe decomposition method
• An exact cooperative method for the uncapacitated facility location problem
• The convex hull of two core capacitated network design problems
• A comparison of heuristics and relaxations for the capacitated plant location problem
• A branch-and-price algorithm for the capacitated facility location problem
• 0-1 reformulations of the multicommodity capacitated network design problem
• Upper and lower bounds for the single source capacitated location problem.
• On splittable and unsplittable flow capacitated network design arc-set polyhedra.
• An improved Lagrangian relaxation and dual ascent approach to facility location problems
• The simple plant location problem: Survey and synthesis
• Bundle methods for sum-functions with ``easy components: applications to multicommodity network design
• A Lagrangian heuristic for the capacitated plant location problem with single source constraints
• Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound
• Efficient solution of large scale, single-source, capacitated plant location problems
• A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
• A Branch-and-Price algorithm for the Single Source Capacitated Plant Location Problem
• Modeling and Solving the Two-Facility Capacitated Network Loading Problem
• Algorithms – ESA 2005
• Bundle-based relaxation methods for multicommodity capacitated fixed charge network design

This page was built for publication: Revisiting Lagrangian relaxation for network design