The bi‐criteria doubly weighted center‐median path problem on a tree
From MaRDI portal
Publication:5487811
DOI10.1002/net.20112zbMath1103.90021OpenAlexW4246456977WikidataQ58217286 ScholiaQ58217286MaRDI QIDQ5487811
Arie Tamir, Antonio M. Rodríguez-Chía, Dionisio Perez-Britos, Justo Puerto
Publication date: 12 September 2006
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://idus.us.es/xmlui/handle/11441/47847
Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)
Related Items (12)
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 ⋮ Extensive facility location problems on networks: an updated review ⋮ An improved algorithm for the minmax regret path centdian problem on trees ⋮ An improved algorithm for the minmax regret path center problem on trees ⋮ Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem ⋮ Comparing different metaheuristic approaches for the median path problem with bounded length ⋮ Range minimization problems in path-facility location on trees ⋮ The continuous and discrete path‐variance problems on trees ⋮ An algorithm for solving the bi-objective median path-shaped facility on a tree network ⋮ Extensive facility location problems on networks with equity measures ⋮ Minimax regret path location on trees
Cites Work
This page was built for publication: The bi‐criteria doubly weighted center‐median path problem on a tree
