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

DOI10.1016/J.EJOR.2018.12.021zbMATH Open1430.90372DBLPjournals/eor/CordeauFL19OpenAlexW2906524013WikidataQ62048251 ScholiaQ62048251MaRDI QIDQ1719620FDOQ1719620

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

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

Recommendations

• A decomposition heuristic for the maximal covering location problem
• A Benders decomposition algorithm for the maximum availability service facility location problem
• Benders decomposition for network design covering problems
• The generalized maximal covering location problem
• Algorithms for large scale set covering problems

zbMATH Keywords

combinatorial optimizationcoveringBenders decompositionlocation problemsbranch-and-cut algorithms

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (30)

• Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems
• Benders decomposition for network design covering problems
• Accelerated Benders decomposition and local branching for dynamic maximum covering location problems
• A new reformulation approach for the generalized partial covering problem
• A Benders decomposition algorithm for the maximum availability service facility location problem
• Discrete optimization methods for group model selection in compressed sensing
• Efficient presolving methods for solving maximal covering and partial set covering location problems
• Minmax regret maximal covering location problems with edge demands
• Upgrading edges in the maximal covering location problem
• Implementing automatic benders decomposition in a modern MIP solver
• 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 star degree centrality problem: a decomposition approach
• 3-D dynamic UAV base station location problem
• A hybrid adaptive iterated local search heuristic for the maximal covering location problem
• Robust min-max regret covering problems
• A new formulation and Benders decomposition for the multi-period maximal covering facility location problem with server uncertainty
• An accelerated Benders decomposition algorithm for solving a double-type double-standard maximal covering location problem
• The incremental connected facility location problem
• Math‐based reinforcement learning for the adaptive budgeted influence maximization problem
• An efficient Benders decomposition for the \(p\)-median problem
• Benders decomposition for a node-capacitated virtual network function placement and routing problem
• Three network design problems for community energy storage
• Multi-type maximal covering location problems: hybridizing discrete and continuous problems
• Spatial and objective decompositions for very large SCAPs
• Benders decomposition for set covering problems. Almost satisfying the consecutive ones property
• On the complexity of the upgrading version of the maximal covering location problem
• Efficient heuristics for a partial set covering problem with mutually exclusive pairs of facilities
• New formulations for two location problems with interconnected facilities

This page was built for publication: Benders decomposition for very large scale partial set covering and maximal covering location problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1719620)