Benders decomposition for very large scale partial set covering and maximal covering location problems
From MaRDI portal
Publication:1719620
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
Cites work
- scientific article; zbMATH DE number 1803755 (Why is no real title available?)
- A Lagrangean heuristic for the maximal covering location problem
- A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem
- A decomposition heuristic for the maximal covering location problem
- A note on the selection of Benders' cuts
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Aggregation effects in maximum covering models
- An exact algorithm for the maximal covering problem
- Benders decomposition without separability: a computational study for capacitated facility location problems
- Continuous space maximal coverage: insights, advances and challenges
- Covering Problems
- Exact approaches to the single-source network loading problem
- Facility siting and integer-friendly programming
- Intelligent-guided adaptive search for the maximum covering location problem
- Location science
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- Partitioning procedures for solving mixed-variables programming problems
- Practical enhancements to the Magnanti-Wong method
- Solving the maximal covering location problem with heuristic concentration
- The Location of Emergency Service Facilities
- The Maximum Coverage Location Problem
- The gradual covering decay location problem on a network.
- ``Facet separation with one linear program
Cited in
(31)- Benders decomposition for a node-capacitated virtual network function placement and routing problem
- Discrete optimization methods for group model selection in compressed sensing
- A hybrid adaptive iterated local search heuristic for the maximal covering location problem
- Three network design problems for community energy storage
- An accelerated Benders decomposition algorithm for solving a double-type double-standard maximal covering location problem
- A Benders decomposition algorithm for the maximum availability service facility location problem
- Benders decomposition for network design covering problems
- 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
- Spatial and objective decompositions for very large SCAPs
- The incremental connected facility location problem
- Robust min-max regret covering problems
- Efficient presolving methods for solving maximal covering and partial set covering location problems
- On the complexity of the upgrading version of the maximal covering location problem
- Math‐based reinforcement learning for the adaptive budgeted influence maximization problem
- Minmax regret maximal covering location problems with edge demands
- The star degree centrality problem: a decomposition approach
- 3-D dynamic UAV base station location problem
- Upgrading edges in the maximal covering location problem
- A new formulation and Benders decomposition for the multi-period maximal covering facility location problem with server uncertainty
- Multi-type maximal covering location problems: hybridizing discrete and continuous problems
- A new reformulation approach for the generalized partial covering problem
- New formulations for two location problems with interconnected facilities
- Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems
- Accelerated Benders decomposition and local branching for dynamic maximum covering location problems
- Implementing automatic benders decomposition in a modern MIP solver
- Benders decomposition for set covering problems. Almost satisfying the consecutive ones property
- Polyhedral results and valid inequalities for the maximal covering location problem
- An efficient Benders decomposition for the \(p\)-median problem
- Efficient heuristics for a partial set covering problem with mutually exclusive pairs of 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)
