On the location of a constrained k-tree facility in a tree network with unreliable edges

DOI10.1155/2019/9520324MaRDI QIDQ2294142zbMATH OpenOpenAlexFDO

Authors Eman Fares, Abdallah W. Aboutahoun

Publication date 10 February 2020

Published in Journal of Applied Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2019/9520324

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Discrete location and assignment (90B80)

Recommendations

• A single facility location problem on a tree with unreliable edges
• scientific article; zbMATH DE number 1063797
• Optimal location of facilities on a network with an unreliable node or link
• Unreliable point facility location problems on networks
• Reliability problems in multiple path-shaped facility location on networks

Cites work

• scientific article; zbMATH DE number 1063797 (Why is no real title available?)
• scientific article; zbMATH DE number 961964 (Why is no real title available?)
• A Linear Time Algorithm for Finding ak-Tree Core
• A linear algorithm for a core of a tree
• A linear time algorithm for computing a most reliable source on a tree network with faulty nodes
• A single facility location problem on a tree with unreliable edges
• Algorithms for a Core and k-Tree Core of a Tree
• Algorithms for central-median paths with bounded length on trees
• Conditional location of path and tree shaped facilities on trees
• Efficient Algorithms for Finding a Core of a Tree with a Specified Length
• Efficient algorithms for a constrained k-tree core problem in a tree network
• Efficient algorithms for finding the (k,l)-core of tree networks
• Facility Location and Reliable Route Planning in Hazardous Material Transportation
• Finding a 2-core of a tree in linear time
• Finding the \(\ell\)-core of a tree
• Location of facilities on a network subject to a single‐edge failure
• Network location of a reliable center using the most reliable route policy
• On finding the core of a tree with a specified length
• On the 2-MRS problem in a tree with unreliable edges
• Optimal location of facilities on a network with an unreliable node or link
• Reliability problems in multiple path-shaped facility location on networks
• The centdian subtree on tree networks
• The optimal location of a path or tree in a tree network

Cited in

(4)

• Tractable Cases of Facility Location on a Network with a Linear Reliability Order of Links
• On the 2-MRS problem in a tree with unreliable edges
• A single facility location problem on a tree with unreliable edges
• Accumulation Point Location on Tree Networks for Guaranteed Time Distribution

This page was built for publication: On the location of a constrained \(k\)-tree facility in a tree network with unreliable edges

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