A multiplier adjustment technique for the capacitated concentrator location problem
From MaRDI portal
Publication:4227929
DOI10.1080/10556789808805703zbMATH Open0916.90173OpenAlexW2045280055MaRDI QIDQ4227929FDOQ4227929
Authors: M. Celani, Raffaele Cerulli, Manlio Gaudioso, Yaroslav D. Sergeyev 
Publication date: 27 July 1999
Published in: Optimization Methods \& Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556789808805703
Recommendations
- Efficient algorithms for the capacitated concentrator location problem
- A Facility Location Problem With Aggregate Capacity
- An improved Lagrangian relaxation and dual ascent approach to facility location problems
- A Multiplier Adjustment Method for the Generalized Assignment Problem
- A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints
dual descent methodcapacitated concentrator locationmultiplier adjustment techniquepure 0-1 location
Cites Work
- A survey of algorithms for the generalized assignment problem
- Efficient algorithms for the capacitated concentrator location problem
- A Multiplier Adjustment Method for the Generalized Assignment Problem
- Modeling Facility Location Problems as Generalized Assignment Problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem
- An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem
Cited In (3)
This page was built for publication: A multiplier adjustment technique for the capacitated concentrator location problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4227929)
