Formulation and algorithms for the robust maximal covering location problem

DOI10.1016/J.ENDM.2018.01.016MaRDI QIDQ1742214zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

heuristicsrobust optimizationuncertain datamin-max regret

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Recommendations

• Robust min-max regret covering problems
• Improved handling of uncertainty and robustness in set covering problems
• Minmax regret maximal covering location problems with edge demands
• A VNS-LP algorithm for the robust dynamic maximal covering location problem
• The robust set covering problem with interval data

Cites work

• An approximation algorithm for interval data minmax regret combinatorial optimization problems
• An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem
• Covering models and optimization techniques for emergency response facility location and planning: a review
• Exact and heuristic algorithms for the interval data robust assignment problem
• Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem
• Maximizing the number of obnoxious facilities to locate within a bounded region
• Min-max and min-max regret versions of combinatorial optimization problems: A survey
• On the finite optimal convergence of logic-based Benders' decomposition in solving 0-1 min-max regret optimization problems with interval costs
• Partitioning procedures for solving mixed-variables programming problems
• Restricted robust uniform matroid maximization under interval uncertainty
• Robust discrete optimization and its applications
• The robust set covering problem with interval data
• The robust spanning tree problem with interval data

Cited in

(11)

• scientific article; zbMATH DE number 5990408 (Why is no real title available?)
• Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty
• Maximum Covering Formulation for Open Locating Dominating Sets
• Improved handling of uncertainty and robustness in set covering problems
• A separation based optimization approach to dynamic maximal covering location problems with switched structure
• Intelligent-guided adaptive search for the maximum covering location problem
• Robust min-max regret covering problems
• Thresholded Covering Algorithms for Robust and Max-min Optimization
• Minmax regret maximal covering location problems with edge demands
• Thresholded covering algorithms for robust and max-min optimization
• A VNS-LP algorithm for the robust dynamic maximal covering location problem

Describes a project that uses

Uses Software

• OR-Library

This page was built for publication: Formulation and algorithms for the robust maximal covering location problem

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