An application-oriented guide for designing Lagrangean dual ascent algorithms

DOI10.1016/0377-2217(89)90213-0zbMath0682.90066OpenAlexW2069618627MaRDI QIDQ1824554

Moshe B. Rosenwein, Monique Guignard

Publication date: 1989

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(89)90213-0

zbMATH Keywords

Lagrange multipliersgeneralized assignment problemLagrangean relaxationconstrained arborescence problemLagrangean dual ascent

Mathematics Subject Classification ID

Integer programming (90C10) Numerical methods involving duality (49M29)

Related Items

Lagrangean relaxation. (With comments and rejoinder)., A branch-and-bound algorithm for the transportation problem with location of \(p\) transshipment points, Heuristicas de descomposicion lagrangiana para algunos problemas de localizacion discreta, Matheuristics: survey and synthesis, Polyhedral results and stronger Lagrangean bounds for stable spanning trees, Refinement of Lagrangian bounds in optimization problems, Decomposition methods for the two-stage stochastic Steiner tree problem, A survey of algorithms for the generalized assignment problem, An application of Lagrangean decomposition to the capacitated multi-item lot sizing problem, Auxiliary tool allocation in flexible manufacturing systems, A multiperiod two-echelon multicommodity capacitated plant location problem, The return plant location problem: Modelling and resolution, Development and evaluation of an assignment heuristic for allocating cross-trained workers, About Lagrangian methods in integer optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Lagrangean dual ascent algorithm for simple plant location problems
• Layering strategies for creating exploitable structure in linear and integer programs
• Lagrangean dual ascent algorithms for computing bounds in capacitated plant location problems
• A Dual-Based Algorithm for Multiproduct Uncapacitated Facility Location
• A Multiplier Adjustment Method for the Generalized Assignment Problem
• A direct dual method for the mixed plant location problem with some side constraints
• A dual ascent approach for steiner tree problems on a directed graph
• An application of lagrangean decomposition to the resource-constrained minimum weighted arborescence problem
• Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
• Lagrangean decomposition: A model yielding stronger lagrangean bounds
• Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem
• A Dual-Based Procedure for Uncapacitated Facility Location
• A Dual-Based Procedure for Dynamic Facility Location
• The traveling-salesman problem and minimum spanning trees: Part II