Efficient online sensitivity analysis for the injective bottleneck path problem

DOI10.1007/S11590-024-02170-5MaRDI QIDQ7289022zbMATH OpenFDO

Authors Kirill V. Kaymakov, D. S. Malyshev

Publication date 2 July 2026

Published in Optimization Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11590-024-02170-5

Mathematics Subject Classification ID

Graph theory (05Cxx) Operations research and management science (90Bxx) Mathematical programming (90Cxx)

Cites work

• A linear algorithm for analysis of minimum spanning and shortest-path trees of planar graphs
• A minimum spanning tree algorithm with inverse-Ackermann type complexity
• A tolerance-based heuristic approach for the weighted independent set problem
• Algorithms and codes for dense assignment problems: The state of the art
• Algorithms for updating minimal spanning trees
• Arc tolerances in shortest path and network flow problems
• Assignment Problems
• Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems
• Efficient computation of tolerances in the weighted independent set problem for some classes of graphs
• Efficient computation of tolerances in the weighted independent set problem for trees
• Fibonacci heaps and their uses in improved network optimization algorithms
• scientific article; zbMATH DE number 1947385 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• scientific article; zbMATH DE number 7646025 (Why is no real title available?)
• Improving the Hungarian assignment algorithm
• Lower tolerance-based branch and bound algorithms for the ATSP
• Min-max and min-max regret versions of combinatorial optimization problems: A survey
• On efficient algorithms for bottleneck path problems with many sources
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs
• Sensitivity analysis of minimum spanning trees in sub-inverse-Ackermann time
• Shortest paths algorithms: Theory and experimental evaluation
• Solution of a min-max vehicle routing problem
• The level ancestor problem simplified
• The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems
• Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Tolerance-based branch and bound algorithms for the ATSP
• Tolerance-based vs. cost-based branching for the asymmetric capacitated vehicle routing problem
• Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time
• Worst-case Analysis of Set Union Algorithms
• Über ein Minimalproblem.

This page was built for publication: Efficient online sensitivity analysis for the injective bottleneck path problem

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