Inverse center location problems
From MaRDI portal
Publication:2883558
DOI10.1016/J.ENDM.2010.05.014zbMATH Open1237.90190OpenAlexW2056664112MaRDI QIDQ2883558FDOQ2883558
Authors: Rainer E. Burkard, Behrooz Alizadeh 
Publication date: 13 May 2012
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2010.05.014
Recommendations
- Inverse center location problem on a tree
- Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
- Computational aspects of the inverse single facility location problem on trees under \(l_k\)-norm
- On some inverse 1-center location problems
- Combinatorial algorithms for the uniform-cost inverse 1-center problem on weighted trees
Cites Work
Cited In (12)
- Computation of inverse 1-center location problem on the weighted trapezoid graphs
- Computation of inverse 1-centre location problem on the weighted interval graphs
- Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees
- Vertex quickest 1-center location problem on trees and its inverse problem under weighted \(l_\infty\) norm
- Inverse center location problem on a tree
- The complexity analysis of the inverse center location problem
- Optimal algorithms for some inverse uncapacitated facility location problems on networks
- Some reverse location problems
- Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
- On some inverse 1-center location problems
- Computational aspects of the inverse single facility location problem on trees under \(l_k\)-norm
- Combinatorial algorithms for the uniform-cost inverse 1-center problem on weighted trees
This page was built for publication: Inverse center location problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2883558)
