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

@article{Imahori2003LocalSA,
  title={Local search algorithms for the rectangle packing problem with general spatial costs},
  author={Shinji Imahori and Mutsunori Yagiura and Toshihide Ibaraki},
  journal={Mathematical Programming},
  year={2003},
  volume={97},
  pages={543-569}
}
  • Shinji Imahori, Mutsunori Yagiura, Toshihide Ibaraki
  • Published in Math. Program. 2003
  • Mathematics, Computer Science
  • Abstract.We propose local search algorithms for the rectangle packing problem to minimize a general spatial cost associated with the locations of rectangles. The problem is to pack given rectangles without overlap in the plane so that the maximum cost of the rectangles is minimized. Each rectangle has a set of modes, where each mode specifies the width and height of the rectangle and its spatial cost function. The spatial costs are general piecewise linear functions which can be non-convex and… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 27 CITATIONS

    Optimizing yard assignment in an automotive transshipment terminal

    VIEW 6 EXCERPTS
    CITES BACKGROUND & METHODS
    HIGHLY INFLUENCED

    Berth management in container terminal: the template design problem

    VIEW 4 EXCERPTS
    CITES METHODS & BACKGROUND
    HIGHLY INFLUENCED

    Improved local search algorithms for the rectangle packing problem with general spatial costs

    VIEW 10 EXCERPTS
    CITES BACKGROUND & METHODS

    Methods of Three-dimensional tactical airspace

    VIEW 4 EXCERPTS
    CITES BACKGROUND
    HIGHLY INFLUENCED