scientific article; zbMATH DE number 1091558
From MaRDI portal
Publication:4367277
DOI<107::AID-NET4>3.0.CO;2-N 10.1002/(SICI)1097-0037(199703)29:2<107::AID-NET4>3.0.CO;2-NzbMath0888.90147MaRDI QIDQ4367277
Akiyoshi Shioura, Maiko Shigeno
Publication date: 25 November 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (11)
Efficient algorithms for the minmax regret path center problem with length constraint on trees ⋮ Extensive facility location problems on networks: an updated review ⋮ The extensive 1-median problem with radius on networks ⋮ Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem ⋮ Locating tree-shaped facilities using the ordered median objective ⋮ Range minimization problems in path-facility location on trees ⋮ The continuous and discrete path‐variance problems on trees ⋮ Extensive facility location problems on networks with equity measures ⋮ Optimal algorithms for the path/tree-shaped facility location problems in trees ⋮ The nestedness property of the convex ordered median location problem on a tree ⋮ The centdian subtree on tree networks
This page was built for publication:
