An effective algorithm for the two-stage location problem on a tree-like network
DOI10.1134/S1990478913020063zbMATH Open1324.90014OpenAlexW1986248408MaRDI QIDQ5263793FDOQ5263793
Authors: Eh. Kh. Gimadi, A. A. Kurochkin 
Publication date: 17 July 2015
Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s1990478913020063
Recommendations
- Two classes of location problems on tree networks
- Simple multistage location problem on a treelike network
- scientific article; zbMATH DE number 1323027
- scientific article; zbMATH DE number 1264405
- Location routing problems on trees
- Optimal algorithms for the path/tree-shaped facility location problems in trees
- Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees
- Lower and upper bounds for a two-level hierarchical location problem in computer networks
- Publication:4493169
- A tree search algorithm for the multi-commodity location problem
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Transportation, logistics and supply chain management (90B06)
Cited In (7)
- A quadratic time exact algorithm for continuous connected 2-facility location problem in trees (extended abstract)
- A quadratic time exact algorithm for continuous connected 2-facility location problem in trees
- Two Matching Based Algorithm for Tree Network Design
- Solving the uncapacited plant location problem on trees
- A polynomial algorithm for solving the facility location problem on a chain network with identical plant production capacities
- Simple multistage location problem on a treelike network
- An optimal algorithm for an outerplanar facility location problem with improved time complexity
This page was built for publication: An effective algorithm for the two-stage location problem on a tree-like network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5263793)
