A multiplier adjustment technique for the capacitated concentrator location problem

DOI10.1080/10556789808805703zbMath0916.90173OpenAlexW2045280055MaRDI QIDQ4227929

M. Celani, Yaroslav D. Sergeyev, Raffaele Cerulli, Manlio Gaudioso

Publication date: 27 July 1999

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556789808805703

zbMATH Keywords

dual descent methodcapacitated concentrator locationmultiplier adjustment techniquepure 0-1 location

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Related Items (2)

On the capacitated concentrator location problem: a reformulation by discretization ⋮ A new extended formulation with valid inequalities for the capacitated concentrator location problem

Cites Work

• Unnamed Item
• Unnamed Item
• Efficient algorithms for the capacitated concentrator location problem
• A survey of algorithms for the generalized assignment problem
• A Multiplier Adjustment Method for the Generalized Assignment Problem
• Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem
• An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem
• Modeling Facility Location Problems as Generalized Assignment Problems

This page was built for publication: A multiplier adjustment technique for the capacitated concentrator location problem