Benders decomposition for very large scale partial set covering and maximal covering location problems

DOI10.1016/j.ejor.2018.12.021zbMath1430.90372OpenAlexW2906524013WikidataQ62048251 ScholiaQ62048251MaRDI QIDQ1719620

Fabio Furini, Ivana Ljubić, Jean-François Cordeau

Publication date: 11 February 2019

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2018.12.021

zbMATH Keywords

coveringcombinatorial optimizationlocation problemsBenders decompositionbranch-and-cut algorithms

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items

Implementing Automatic Benders Decomposition in a Modern MIP Solver, Robust min-max regret covering problems, The Star Degree Centrality Problem: A Decomposition Approach, 3-D Dynamic UAV Base Station Location Problem, An accelerated Benders decomposition algorithm for solving a double-type double-standard maximal covering location problem, Minmax regret maximal covering location problems with edge demands, Benders decomposition for a node-capacitated virtual network function placement and routing problem, Benders decomposition for network design covering problems, Upgrading edges in the maximal covering location problem, Efficient heuristics for a partial set covering problem with mutually exclusive pairs of facilities, Multi-type maximal covering location problems: hybridizing discrete and continuous problems, An efficient Benders decomposition for the \(p\)-median problem, Efficient presolving methods for solving maximal covering and partial set covering location problems, Math‐based reinforcement learning for the adaptive budgeted influence maximization problem, Discrete optimization methods for group model selection in compressed sensing, Large-scale influence maximization via maximal covering location, Capacitated multi-period maximal covering location problem with server uncertainty, Branch-and-cut approach based on generalized Benders decomposition for facility location with limited choice rule, The incremental connected facility location problem, Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems, A Benders decomposition algorithm for the maximum availability service facility location problem

Cites Work

• Unnamed Item
• Benders decomposition without separability: a computational study for capacitated facility location problems
• Continuous space maximal coverage: insights, advances and challenges
• A decomposition heuristic for the maximal covering location problem
• Aggregation effects in maximum covering models
• Practical enhancements to the Magnanti-Wong method
• Partitioning procedures for solving mixed-variables programming problems
• Facility siting and integer-friendly programming
• A Lagrangean heuristic for the maximal covering location problem
• The gradual covering decay location problem on a network.
• A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem
• Intelligent-guided adaptive search for the maximum covering location problem
• ``Facet separation with one linear program
• Solving the maximal covering location problem with heuristic concentration
• A note on the selection of Benders' cuts
• Exact approaches to the single-source network loading problem
• The Maximum Coverage Location Problem
• Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
• An exact algorithm for the maximal covering problem
• Location Science
• Covering Problems
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
• The Location of Emergency Service Facilities