An application-oriented guide for designing Lagrangean dual ascent algorithms
From MaRDI portal
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
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
Lagrange multipliersLagrangean relaxationgeneralized assignment problemconstrained arborescence problemLagrangean dual ascent
Cites Work
- The traveling-salesman problem and minimum spanning trees: Part II
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- A Multiplier Adjustment Method for the Generalized Assignment Problem
- A Dual-Based Procedure for Dynamic Facility Location
- Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
- A Dual-Based Procedure for Uncapacitated Facility Location
- A dual ascent approach for steiner tree problems on a directed graph
- Title not available (Why is that?)
- Layering strategies for creating exploitable structure in linear and integer programs
- A Lagrangean dual ascent algorithm for simple plant location problems
- Title not available (Why is that?)
- A direct dual method for the mixed plant location problem with some side constraints
- An application of lagrangean decomposition to the resource-constrained minimum weighted arborescence problem
- Title not available (Why is that?)
- Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem
- Lagrangean dual ascent algorithms for computing bounds in capacitated plant location problems
- A Dual-Based Algorithm for Multiproduct Uncapacitated Facility Location
Cited In (18)
- Title not available (Why is that?)
- The return plant location problem: Modelling and resolution
- A survey of algorithms for the generalized assignment problem
- Lagrangian dual ascent by generalized linear programming
- Decomposition methods for the two-stage stochastic Steiner tree problem
- Refinement of Lagrangian bounds in optimization problems
- Auxiliary tool allocation in flexible manufacturing systems
- Matheuristics: survey and synthesis
- A Lagrangean dual ascent algorithm for simple plant location problems
- About Lagrangian methods in integer optimization
- A branch-and-bound algorithm for the transportation problem with location of \(p\) transshipment points
- Lagrangean relaxation. (With comments and rejoinder).
- Development and evaluation of an assignment heuristic for allocating cross-trained workers
- A multiperiod two-echelon multicommodity capacitated plant location problem
- Polyhedral results and stronger Lagrangean bounds for stable spanning trees
- An application of Lagrangean decomposition to the capacitated multi-item lot sizing problem
- Heuristicas de descomposicion lagrangiana para algunos problemas de localizacion discreta
- On solving the Lagrangian dual of integer programs via an incremental approach
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)
