An Optimal Algorithm for the Stacker Crane Problem on Fixed Topologies

Chen, Y., Shi, K., & Xu, C. (2025). An Optimal Algorithm for the Stacker Crane Problem on Fixed Topologies. ISAAC 2025.

Type

Conference paper

Intellectual base

Primary research

Year

2025

Link

https://drops.dagstuhl.de/storage/00lipics/lipics-vol359-isaac2025/html/LIPIcs.ISAAC.2025.18/LIPIcs.ISAAC.2025.18.html

Cited by

1 citation across 1 artifact.

Domain-specific

• Stacker Crane Problem
  • In the equivalent mixed-graph formulation, requests are required directed arcs and ordinary travel edges connect them; the route must traverse every required arc in its direction.

Verification

Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.

Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Registry ID ref:24fe3dcd4be4 · see in the full table