Reverse 1-centre problem on trees under convex piecewise-linear cost function

DOI10.1080/02331934.2021.1995730OpenAlexW3208712380MaRDI QIDQ5882838FDOQ5882838

Ali Reza Sepasian, Javad Tayyebi

Publication date: 17 March 2023

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2021.1995730

Recommendations

• Reverse 1-center problem on weighted trees
• Further study on reverse 1-center problem on trees
• The uniform cost reverse 1-centdian location problem on tree networks with edge length reduction
• Inverse center location problem on a tree
• scientific article; zbMATH DE number 1522936

zbMATH Keywords

treesefficient algorithmsminimum cost flow problemreverse optimization1-centre problem

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Calculus of variations and optimal control; optimization (49-XX)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Inverse median problems
• Inverse 1-median problem on block graphs with variable vertex weights
• Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
• The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance
• An algorithm for the Inverse 1-median problem on trees with variable vertex weights and edge reductions
• Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees
• A simplex algorithm for piecewise-linear programming I: Derivation and proof
• The inverse 1-maxian problem with edge length modification
• The inverse Fermat-Weber problem
• Reverse 1-center problem on weighted trees
• Some variants of reverse selective center location problem on trees under the Chebyshev and Hamming norms
• Improving the location of minimax facilities through network modification
• Some reverse location problems
• Reverse 2-median problem on trees
• The worst-case running time of the random simplex algorithm is exponential in the height
• Improving the location of minisum facilities through network modification
• Extensive facility location problems on networks: an updated review
• A linear time algorithm for the reverse 1‐median problem on a cycle
• Title not available (Why is that?)
• Optimal algorithms for inverse vertex obnoxious center location problems on graphs
• Reverse selective obnoxious center location problems on tree graphs
• Linear time optimal approaches for reverse obnoxious center location problems on networks
• Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks

Cited In (5)

• The uniform cost reverse 1-centdian location problem on tree networks with edge length reduction
• Inverse vertex/absolute quickest 1-center location problem on a tree under weighted \(l_1\) norm
• The reverse selective balance center location problem on trees
• Title not available (Why is that?)
• The Minmax Regret Reverse 1-Median Problem on Trees with Uncertain Vertex Weights

This page was built for publication: Reverse 1-centre problem on trees under convex piecewise-linear cost function

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