An algorithm for solving the bi-objective median path-shaped facility on a tree network

DOI10.1186/S42787-019-0063-4zbMath1432.90025OpenAlexW3000326073MaRDI QIDQ2305157

Fatma El-Safty, Abdallah W. Aboutahoun

Publication date: 10 March 2020

Published in: Journal of the Egyptian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1186/s42787-019-0063-4

zbMATH Keywords

Pareto solutiontwo-phase method\(k\)-best algorithmmedian path

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Continuous location (90B85) Graph theory (including graph drawing) in computer science (68R10) Management decision making, including multiple objectives (90B50) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• An optimal algorithm for the weighted backup 2-center problem on a tree
• The inverse \(p\)-maxian problem on trees with variable edge lengths
• A polynomial algorithm for the multicriteria cent-dian location problem
• Algorithms for central-median paths with bounded length on trees
• Bound sets for biobjective combinatorial optimization problems
• A comparison of solution strategies for biobjective shortest path problems
• A two-phase algorithm for the biobjective integer minimum cost flow problem
• Optimal algorithms for the path/tree-shaped facility location problems in trees
• Locating a facility on a network with multiple median-type objectives
• Finding the \(\ell\)-core of a tree
• The centdian subtree on tree networks
• Multiple facility location on a network with linear reliability order of edges
• Algorithms for path medi-centers of a tree
• Finding a core of a tree with pos/neg weight
• Computing all efficient solutions of the biobjective minimum spanning tree problem
• Linear time optimal approaches for reverse obnoxious center location problems on networks
• On finding the core of a tree with a specified length
• INDUCTIVE ALGORITHMS ON FINITE TREES
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• A linear algorithm for a core of a tree
• Multicriteria network location problems with sum objectives
• Efficient Algorithms for Finding a Core of a Tree with a Specified Length
• Multicriteria Optimization
• Conditional location of path and tree shaped facilities on trees
• The bi‐criteria doubly weighted center‐median path problem on a tree

This page was built for publication: An algorithm for solving the bi-objective median path-shaped facility on a tree network