Benders decomposition for very large scale partial set covering and maximal covering location problems
Authors:
- Jean-François CordeauJCJean-François Cordeau
- Fabio FuriniFFFabio Furini
- Ivana LjubićILIvana Ljubić
Top Cited Papers
- 1 June 2019
- journal article
- research article
- Published by Elsevier in European Journal of Operational Research
- Vol. 275 (3) , 882-896
Abstract
No abstract availableKeywords
Funding Information
- Vienna Science and Technology Fund (ICT15-014)
This publication has 29 references indexed in Scilit:
- Covering problems in facility location: A reviewComputers & Industrial Engineering, 2012
- Exact approaches to the single‐source network loading problemNetworks, 2011
- Solving the maximal covering location problem with heuristic concentrationComputers & Operations Research, 2008
- The gradual covering decay location problem on a networkEuropean Journal of Operational Research, 2003
- A comparison of Lagrangean and surrogate relaxations for the maximal covering location problemEuropean Journal of Operational Research, 2000
- Two New Location Covering Problems: The Partial P‐Center Problem and the Partial Set Covering ProblemGeographical Analysis, 1999
- An exact algorithm for the maximal covering problemNaval Research Logistics (NRL), 1996
- A Lagrangean heuristic for the maximal covering location problemEuropean Journal of Operational Research, 1996
- Aggregation effects in maximum covering modelsAnnals of Operations Research, 1989
- Partitioning procedures for solving mixed-variables programming problemsNumerische Mathematik, 1962