A note on the robust 1-center problem on trees

DOI10.1023/A:1020711416254zbMath1013.90075MaRDI QIDQ1872013

Helidon Dollani, Rainer E. Burkard

Publication date: 4 May 2003

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

location problems; robust optimization; center problem

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C08: Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.)

90B80: Discrete location and assignment

Related Items

The backup 2‐center and backup 2‐median problems on trees, Robust mean absolute deviation problems on networks with linear vertex weights, A new formulation and Benders decomposition for the multi-period maximal covering facility location problem with server uncertainty, Robust vertex \(p\)-center model for locating urgent relief distribution centers, Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks, Minmax regret location--allocation problem on a network under uncertainty, Robust placement of sensors in dynamic water distribution systems, A quadratic time exact algorithm for continuous connected 2-facility location problem in trees, An improved algorithm for the minmax regret path centdian problem on trees, Inverse quickest center location problem on a tree, Capacitated multi-period maximal covering location problem with server uncertainty, On the minmax regret path median problem on trees, Robust weighted vertex \(p\)-center model considering uncertain data: an application to emergency management, New approaches to the robust 1-center location problems on tree networks, The \(p\)-center problem under locational uncertainty of demand points