On the location of a constrained k-tree facility in a tree network with unreliable edges
DOI10.1155/2019/9520324zbMATH Open1442.68157OpenAlexW2969917739MaRDI QIDQ2294142FDOQ2294142
Authors: Eman Fares, Abdallah W. Aboutahoun 
Publication date: 10 February 2020
Published in: Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2019/9520324
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
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)
Cites Work
- Efficient Algorithms for Finding a Core of a Tree with a Specified Length
- Facility Location and Reliable Route Planning in Hazardous Material Transportation
- Optimal location of facilities on a network with an unreliable node or link
- Location of facilities on a network subject to a single‐edge failure
- A single facility location problem on a tree with unreliable edges
- The centdian subtree on tree networks
- The optimal location of a path or tree in a tree network
- Efficient algorithms for a constrained k-tree core problem in a tree network
- Efficient algorithms for finding the (k,l)-core of tree networks
- Conditional location of path and tree shaped facilities on trees
- A linear algorithm for a core of a tree
- Title not available (Why is that?)
- A linear time algorithm for computing a most reliable source on a tree network with faulty nodes
- Network location of a reliable center using the most reliable route policy
- Algorithms for a Core and k-Tree Core of a Tree
- Title not available (Why is that?)
- Algorithms for central-median paths with bounded length on trees
- Finding the \(\ell\)-core of a tree
- Reliability problems in multiple path-shaped facility location on networks
- Finding a 2-core of a tree in linear time
- On finding the core of a tree with a specified length
- A Linear Time Algorithm for Finding ak-Tree Core
- On the 2-MRS problem in a tree with unreliable edges
Cited In (4)
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)
