A note on the minmax regret centdian location on trees

DOI10.1016/j.orl.2007.05.009zbMath1144.90433OpenAlexW2063535497MaRDI QIDQ935247

Eduardo Conde

Publication date: 6 August 2008

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2007.05.009

zbMATH Keywords

robust optimizationlocationCentdian criterion

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Discrete location and assignment (90B80)

Related Items (12)

Minmax regret 1-facility location on uncertain path networks ⋮ Efficient algorithms for the minmax regret path center problem with length constraint on trees ⋮ A quadratic time exact algorithm for continuous connected 2-facility location problem in trees ⋮ Robust mean absolute deviation problems on networks with linear vertex weights ⋮ An improved algorithm for the minmax regret path centdian problem on trees ⋮ An improved algorithm for the minmax regret path center problem on trees ⋮ Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks ⋮ Minimax regret 1-median problem in dynamic path networks ⋮ Minimax regret path location on trees ⋮ Minmax regret \(k\)-sink location on a dynamic path network with uniform capacities ⋮ Minimax regret 1-sink location problem in dynamic path networks ⋮ On the minmax regret path median problem on trees

Cites Work

• Robust discrete optimization and its applications
• Algorithms for the robust 1-center problem on a tree
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• Minimax regret p-center location on a network with demand uncertainty
• Multicriteria network location problems with sum objectives
• A polynomial algorithm for thep-centdian problem on a tree
• An improved algorithm for the minmax regret median problem on a tree

This page was built for publication: A note on the minmax regret centdian location on trees