Efficient presolving methods for solving maximal covering and partial set covering location problems
From MaRDI portal
Publication:6168589
DOI10.1016/j.ejor.2023.04.044OpenAlexW4372232615MaRDI QIDQ6168589
Shengjie Chen, Wei-Kun Chen, Yu-Hong Dai, Juan Chen, Liang Chen, Tao Quan
Publication date: 11 July 2023
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2023.04.044
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A mean-shift algorithm for large-scale planar maximal covering location problems
- Demand point aggregation method for covering problems with gradual coverage
- Using dual presolving reductions to reformulate cumulative constraints
- A branch and cut solver for the maximum stable set problem
- A note on detecting simple redundancies in linear systems
- Progress in presolving for mixed integer programming
- Aggregation effects in maximum covering models
- A Lagrangean heuristic for the maximal covering location problem
- Intelligent-guided adaptive search for the maximum covering location problem
- Benders decomposition for very large scale partial set covering and maximal covering location problems
- Presolving in linear programming
- Large-scale influence maximization via maximal covering location
- New exact algorithms for planar maximum covering location by ellipses problems
- Two-row and two-column mixed-integer presolve using hashing-based pairing methods
- Conditional facility location problems with continuous demand and a polygonal barrier
- The minimal covering location and sizing problem in the presence of gradual cooperative coverage
- A tighter formulation of the \(p\)-median problem
- On the fuzzy maximal covering location problem
- Solving the maximal covering location problem with heuristic concentration
- An aggressive reduction scheme for the simple plant location problem
- Continuous maximal covering location problems with interconnected facilities
- Spatial Optimization of Resources Deployment for Forest-Fire Management
- Network and Discrete Location: Models, Algorithms, and Applications, Second Edition
- Solution of Large Quadratic Knapsack Problems Through Aggressive Reduction
- Covering Linear Programming with Violations
- Presolve Reductions in Mixed Integer Programming
- Mixed Integer Programming Computation
- The Maximum Coverage Location Problem
- An exact algorithm for the maximal covering problem
- Reducibility among Combinatorial Problems
- Mixed Integer Programming: Analyzing 12 Years of Progress
- Covering Problems
- The Location of Emergency Service Facilities
- Planar Maximum Coverage Location Problem with Partial Coverage and Rectangular Demand and Service Zones
This page was built for publication: Efficient presolving methods for solving maximal covering and partial set covering location problems
