Formulation and algorithms for the robust maximal covering location problem
type: Item
instance of: scholarly article
title: Formulation and algorithms for the robust maximal covering location problem
zbMATH Open document ID: 1392.90075
author: Andréa Cynthia Santos
author: Thiago F. Noronha
author: Amadeu Almeida Coco
publication date: 2018-04-11T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6858352
zbMATH Keywords: robust optimization
zbMATH Keywords: min-max regret
zbMATH Keywords: uncertain data
zbMATH Keywords: heuristics
describes a project that uses: OR-Library
MaRDI profile type: Publication
full work available at URL: j.endm.2018.01.016
OpenAlex ID: W2794175087
cites work: Maximizing the number of obnoxious facilities to locate within a bounded region
cites work: Min-max and min-max regret versions of combinatorial optimization problems: A survey
cites work: On the Finite Optimal Convergence of Logic-Based Benders’ Decomposition in Solving 0–1 Min-Max Regret Optimization Problems with Interval Costs
cites work: Partitioning procedures for solving mixed-variables programming problems
cites work: An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem
cites work: Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem
cites work: Restricted robust uniform matroid maximization under interval uncertainty
cites work: An approximation algorithm for interval data minmax regret combinatorial optimization problems
cites work: Robust discrete optimization and its applications
cites work: Covering models and optimization techniques for emergency response facility location and planning: a review
cites work: Exact and heuristic algorithms for the interval data robust assignment problem
cites work: The robust set covering problem with interval data
cites work: The robust spanning tree problem with interval data
DOI: 10.1016/J.ENDM.2018.01.016
description: scientific article; zbMATH DE number 6858352