Formulation and algorithms for the robust maximal covering location problem
From MaRDI portal
Publication:1742214
DOI10.1016/J.ENDM.2018.01.016zbMath1392.90075OpenAlexW2794175087MaRDI QIDQ1742214
Andréa Cynthia Santos, Thiago F. Noronha, Amadeu Almeida Coco
Publication date: 11 April 2018
Full work available at URL: https://doi.org/10.1016/j.endm.2018.01.016
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (3)
Robust min-max regret covering problems ⋮ Minmax regret maximal covering location problems with edge demands ⋮ Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty
Uses Software
Cites Work
- The robust set covering problem with interval data
- An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem
- Exact and heuristic algorithms for the interval data robust assignment problem
- Maximizing the number of obnoxious facilities to locate within a bounded region
- Restricted robust uniform matroid maximization under interval uncertainty
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- An approximation algorithm for interval data minmax regret combinatorial optimization problems
- Partitioning procedures for solving mixed-variables programming problems
- Robust discrete optimization and its applications
- Covering models and optimization techniques for emergency response facility location and planning: a review
- On the Finite Optimal Convergence of Logic-Based Benders’ Decomposition in Solving 0–1 Min-Max Regret Optimization Problems with Interval Costs
- Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem
- The robust spanning tree problem with interval data
This page was built for publication: Formulation and algorithms for the robust maximal covering location problem
