Minimax regret single-facility ordered median location problems on networks
From MaRDI portal
Publication:2901048
Recommendations
- New Results on Minimax Regret Single Facility Ordered Median Location Problems on Networks
- Minmax Regret Median Location on a Network Under Uncertainty
- The minmax relative regret median problem on networks
- Facility location problems with uncertainty on the plane
- Minimax regret p-center location on a network with demand uncertainty
Cited in
(22)- On the minmax regret path median problem on trees
- The ordered \(k\)-median problem: surrogate models and approximation algorithms
- Exact algorithms for handling outliers in center location problems on networks using \(k\)-max functions
- Minmax regret 1-facility location on uncertain path networks
- Minimax regret path location on trees
- Minmax regret maximal covering location problems with edge demands
- A fresh view on the discrete ordered median problem based on partial monotonicity
- Locating a facility on a network with multiple median-type objectives
- A single facility minisum location problem with uncertainty
- Minmax regret location--allocation problem on a network under uncertainty
- Robust mean absolute deviation problems on networks with linear vertex weights
- Conditional median as a robust solution concept for uncapacitated location problems
- New Results on Minimax Regret Single Facility Ordered Median Location Problems on Networks
- Optimal shrinking of the distribution chain: the facilities delocation decision
- Minmax regret k-sink location on a dynamic path network with uniform capacities
- A comparative study of different formulations for the capacitated discrete ordered median problem
- A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem
- A minimax regret model for the leader-follower facility location problem
- Competitive facility location under attrition
- Lexicographic \(\alpha\)-robustness: an application to the 1-median problem
- Minimax regret 1-sink location problem in dynamic path networks
- An improved algorithm for the minmax regret path centdian problem on trees
This page was built for publication: Minimax regret single-facility ordered median location problems on networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2901048)
