The absolute quickest 1-center problem on a cycle and its reverse problem

DOI10.1007/S10479-024-06361-2MaRDI QIDQ6983091zbMATH OpenFDO

Authors Kien Trung Nguyen

Publication date 15 May 2025

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10479-024-06361-2

zbMATH Keywords

1-centercyclelocation problemquickest pathreverse optimization

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Discrete location and assignment (90B80) Combinatorial optimization (90C27)

Cites work

• A comprehensive survey on the quickest path problem
• A label-setting algorithm for finding a quickest path
• A linear time algorithm for the maximum capacity path problem
• A linear time algorithm for the reverse 1‐median problem on a cycle
• A note on two problems in connexion with graphs
• Algorithms for the quickest path problem and the reliable quickest path problem
• An algorithm for the quickest path problem
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• Fifty years of location theory -- a selective review
• Further study on reverse 1-center problem on trees
• scientific article; zbMATH DE number 1746287 (Why is no real title available?)
• Improving the location of minimax facilities through network modification
• Improving the location of minisum facilities through network modification
• Inverse combinatorial optimization: a survey on problems, methods, and results
• Inverse quickest center location problem on a tree
• Inverse vertex/absolute quickest 1-center location problem on a tree under weighted \(l_1\) norm
• Linear time optimal approaches for reverse obnoxious center location problems on networks
• Reverse 1-center problem on weighted trees
• Reverse 2-median problem on trees
• Reverse selective obnoxious center location problems on tree graphs
• Robust reverse 1-center problems on trees with interval costs
• Solving the absolute 1-center problem in the quickest path case
• Some reverse location problems
• The Minmax Regret Reverse 1-Median Problem on Trees with Uncertain Vertex Weights
• The quickest path problem
• Vertex quickest 1-center location problem on trees and its inverse problem under weighted \(l_\infty\) norm

This page was built for publication: The absolute quickest 1-center problem on a cycle and its reverse problem

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