Minimax Regret Single-Facility Ordered Median Location Problems on Networks

DOI10.1287/ijoc.1080.0280zbMath1243.90032DBLPjournals/informs/PuertoRT09OpenAlexW2098157133WikidataQ58217234 ScholiaQ58217234MaRDI QIDQ2901048

Arie Tamir, Antonio M. Rodríguez-Chía, Justo Puerto

Publication date: 28 July 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.1080.0280

zbMATH Keywords

networksanalysis of algorithmsfacility location

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20)

Related Items (17)

Exact algorithms for handling outliers in center location problems on networks using \(k\)-max functions ⋮ Minmax regret 1-facility location on uncertain path networks ⋮ Robust mean absolute deviation problems on networks with linear vertex weights ⋮ An improved algorithm for the minmax regret path centdian problem on trees ⋮ A comparative study of different formulations for the capacitated discrete ordered median problem ⋮ Minmax regret maximal covering location problems with edge demands ⋮ Conditional median as a robust solution concept for uncapacitated location problems ⋮ Competitive facility location under attrition ⋮ A fresh view on the discrete ordered median problem based on partial monotonicity ⋮ Lexicographicα-robustness: an application to the 1-median problem ⋮ A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem ⋮ Minimax regret path location on trees ⋮ The ordered \(k\)-median problem: surrogate models and approximation algorithms ⋮ Minmax regret \(k\)-sink location on a dynamic path network with uniform capacities ⋮ Optimal shrinking of the distribution chain: the facilities delocation decision ⋮ Minimax regret 1-sink location problem in dynamic path networks ⋮ On the minmax regret path median problem on trees

This page was built for publication: Minimax Regret Single-Facility Ordered Median Location Problems on Networks