Benders decomposition for very large scale partial set covering and maximal covering location problems
type: Item
instance of: scholarly article
title: Benders decomposition for very large scale partial set covering and maximal covering location problems
zbMATH Open document ID: 1430.90372
author: Jean-François Cordeau
author: Fabio Furini
author: Ivana Ljubić
published in: European Journal of Operational Research
publication date: 2019-02-11T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 7020240
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: location problems
zbMATH Keywords: covering
zbMATH Keywords: Benders decomposition
zbMATH Keywords: branch-and-cut algorithms
MaRDI profile type: Publication
full work available at URL: j.ejor.2018.12.021
OpenAlex ID: W2906524013
Wikidata QID: Q62048251
cites work: Partitioning procedures for solving mixed-variables programming problems
cites work: The gradual covering decay location problem on a network.
cites work: ``Facet'' separation with one linear program
cites work: Aggregation effects in maximum covering models
cites work: An exact algorithm for the maximal covering problem
cites work: Benders decomposition without separability: a computational study for capacitated facility location problems
cites work: A note on the selection of Benders' cuts
cites work: A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem
cites work: A Lagrangean heuristic for the maximal covering location problem
cites work: Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
cites work: Location Science
cites work: Exact approaches to the single-source network loading problem
cites work: Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
cites work: Intelligent-guided adaptive search for the maximum covering location problem
cites work: The Maximum Coverage Location Problem
cites work: Practical enhancements to the Magnanti-Wong method
cites work: Q3147657
cites work: Facility siting and integer-friendly programming
cites work: Solving the maximal covering location problem with heuristic concentration
cites work: A decomposition heuristic for the maximal covering location problem
cites work: Covering Problems
cites work: The Location of Emergency Service Facilities
cites work: Continuous space maximal coverage: insights, advances and challenges
DOI: 10.1016/J.EJOR.2018.12.021
DBLP publication ID: journals/eor/CordeauFL19
description: scientific article; zbMATH DE number 7020240