Solutions to Real-World Instances of PSPACE-Complete Stacking

DOI10.1007/978-3-540-75520-3_64zbMath1151.90528OpenAlexW1782559531MaRDI QIDQ3527262

Felix G. König, Rolf H. Möhring, Ines Spenke, Marco E. Lübbecke, Guido Schäfer

Publication date: 25 September 2008

Published in: Algorithms – ESA 2007 (Search for Journal in Brave)

Full work available at URL: https://depositonce.tu-berlin.de/handle/11303/15624

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

Optimising the Slab Yard Planning and Crane Scheduling Problem using a two-stage heuristic, Loading, unloading and premarshalling of stacks in storage areas: survey and classification, The pickup and delivery problem with time windows, multiple stacks, and handling operations, An exact algorithm for the unrestricted block relocation problem, Rerouting shortest paths in planar graphs, An efficient and fast local search based heuristic for reel management in a production line of oil extraction pipes, An asymptotically optimal algorithm for online stacking, A mathematical formulation and complexity considerations for the blocks relocation problem, An exact approach to the restricted block relocation problem based on a new integer programming formulation, Using contracted solution graphs for solving reconfiguration problems