1 problem
- 0 votes0 replies0 views
Polynomial-time solvability of the Stacker Crane Problem on fixed topologies
Let a topology be a fixed graph structure, and consider instances of the Stacker Crane Problem (SCP) whose underlying graphs have that topology. Paths and cycles are topologically…