The bi‐criteria doubly weighted center‐median path problem on a tree

DOI10.1002/NET.20112MaRDI QIDQ5487811zbMATH OpenOpenAlexWikidataFDO

Authors Antonio M. Rodríguez-Chía, Arie Tamir, Justo Puerto, Dionisio Pérez-Brito

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

zbMATH Keywords

bi-criteria locationcenter-median pathslength constrained pathslocation on trees

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)

Recommendations

• The bi-criteria doubly weighted center-median path problem on a tree
• Algorithms for path medi-centers of a tree
• Algorithms for central-median paths with bounded length on trees
• The centdian subtree on tree networks
• scientific article; zbMATH DE number 2081036

Cited in

(16)

• Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem
• scientific article; zbMATH DE number 2081036 (Why is no real title available?)
• Efficient algorithms for the minmax regret path center problem with length constraint on trees
• An improved algorithm for the minmax regret path center problem on trees
• The continuous and discrete path‐variance problems on trees
• Extensive facility location problems on networks: an updated review
• A quadratic time exact algorithm for continuous connected 2-facility location problem in trees
• Extensive facility location problems on networks with equity measures
• Minimax regret path location on trees
• Two paths location of a tree with positive or negative weights
• The bi-criteria doubly weighted center-median path problem on a tree
• Range minimization problems in path-facility location on trees
• Comparing different metaheuristic approaches for the median path problem with bounded length
• An algorithm for solving the bi-objective median path-shaped facility on a tree network
• Two paths location of a tree with positive or negative weights
• An improved algorithm for the minmax regret path centdian problem on trees

This page was built for publication: The bi‐criteria doubly weighted center‐median path problem on a tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5487811)