Local search algorithms for the rectangle packing problem with general spatial costs

DOI10.1007/s10107-003-0427-1zbMath1106.90370OpenAlexW2027365160MaRDI QIDQ1403304

Toshihide Ibaraki, Mutsunori Yagiura, Shinji Imahori

Publication date: 1 September 2003

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-003-0427-1

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (12)

Scheduling under the network of temporo-spatial proximity relationships ⋮ An exact strip packing algorithm based on canonical forms ⋮ Models and algorithms for packing rectangles into the smallest square ⋮ Space and time allocation in a shipyard assembly hall ⋮ Optimizing yard assignment in an automotive transshipment terminal ⋮ The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers ⋮ Berth management in container terminal: the template design problem ⋮ Handling precedence constraints in scheduling problems by the sequence pair representation ⋮ A personal perspective on problem solving by general purpose solvers ⋮ Operations research at container terminals: a literature update ⋮ Improved local search algorithms for the rectangle packing problem with general spatial costs ⋮ Exact algorithms for the two-dimensional strip packing problem with and without rotations

This page was built for publication: Local search algorithms for the rectangle packing problem with general spatial costs