An optimal algorithm for the stacker crane problem on fixed topologies

DOI10.4230/LIPICS.ISAAC.2025.18MaRDI QIDQ7364358zbMATH OpenFDO

Authors Yike Chen, Ke Shi, Chao Xu

Publication date 1 October 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ISAAC.2025.18

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• A Note on the Complexity of a Simple Transportation Problem
• An O(n) algorithm for the linear multiple choice knapsack problem and related problems
• Approximation algorithms for multi-vehicle stacker crane problems
• Approximation algorithms for some min-max and minimum stacker crane cover problems
• Approximation algorithms for the generalized stacker crane problem
• Arc Routing
• Classes of cycle bases
• Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel
• Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane
• scientific article; zbMATH DE number 1179517 (Why is no real title available?)
• scientific article; zbMATH DE number 828003 (Why is no real title available?)
• scientific article; zbMATH DE number 1424551 (Why is no real title available?)
• Linear Programming in Linear Time When the Dimension Is Fixed
• Maximum flow and minimum-cost flow in almost-linear time
• Network flow algorithms
• Network flows. Theory, algorithms, and applications.
• Nonpreemptive Ensemble Motion Planning on a Tree
• Routing order pickers in a warehouse with a middle aisle
• Steiner's problem in graphs and its implications

This page was built for publication: An optimal algorithm for the stacker crane problem on fixed topologies

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