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 problemsrobust optimizationcenter problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Discrete location and assignment (90B80)

Related Items (15)

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

This page was built for publication: A note on the robust 1-center problem on trees