An application-oriented guide for designing Lagrangean dual ascent algorithms

DOI10.1016/0377-2217(89)90213-0zbMATH Open0682.90066OpenAlexW2069618627MaRDI QIDQ1824554FDOQ1824554

Authors Monique Guignard, Moshe B. Rosenwein 

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 multipliersLagrangean relaxationgeneralized assignment problemconstrained arborescence problemLagrangean dual ascent

Mathematics Subject Classification ID

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

Recommendations

• A Lagrangean dual ascent algorithm for simple plant location problems
• On solving the Lagrangian dual of integer programs via an incremental approach
• Lagrangean relaxation. (With comments and rejoinder).
• Lagrangean dual ascent algorithms for computing bounds in capacitated plant location problems
• scientific article; zbMATH DE number 1094769

Cites work

• scientific article; zbMATH DE number 3961370 (Why is no real title available?)
• scientific article; zbMATH DE number 3542191 (Why is no real title available?)
• scientific article; zbMATH DE number 3568354 (Why is no real title available?)
• A Dual-Based Algorithm for Multiproduct Uncapacitated Facility Location
• A Dual-Based Procedure for Dynamic Facility Location
• A Dual-Based Procedure for Uncapacitated Facility Location
• A Lagrangean dual ascent algorithm for simple plant location problems
• 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
• Lagrangean decomposition: A model yielding stronger lagrangean bounds
• Lagrangean dual ascent algorithms for computing bounds in capacitated plant location problems
• Layering strategies for creating exploitable structure in linear and integer programs
• Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
• Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem
• The traveling-salesman problem and minimum spanning trees: Part II

Cited in

(18)

• scientific article; zbMATH DE number 3993306 (Why is no real title available?)
• A survey of algorithms for the generalized assignment problem
• Decomposition methods for the two-stage stochastic Steiner tree problem
• An application of Lagrangean decomposition to the capacitated multi-item lot sizing problem
• Refinement of Lagrangian bounds in optimization problems
• Auxiliary tool allocation in flexible manufacturing systems
• Matheuristics: survey and synthesis
• Lagrangian dual ascent by generalized linear programming
• A Lagrangean dual ascent algorithm for simple plant location problems
• A branch-and-bound algorithm for the transportation problem with location of \(p\) transshipment points
• Polyhedral results and stronger Lagrangean bounds for stable spanning trees
• Lagrangean relaxation. (With comments and rejoinder).
• A multiperiod two-echelon multicommodity capacitated plant location problem
• The return plant location problem: Modelling and resolution
• On solving the Lagrangian dual of integer programs via an incremental approach
• About Lagrangian methods in integer optimization
• Heuristicas de descomposicion lagrangiana para algunos problemas de localizacion discreta
• Development and evaluation of an assignment heuristic for allocating cross-trained workers

This page was built for publication: An application-oriented guide for designing Lagrangean dual ascent algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1824554)