Cutting and Packing Instances

  • The Best-fit Heuristic for the Rectangular Strip Packing Problem: An Efficient Implementation and the Worst-case Approximation Ratio
    S    hinji Imahori, Mutsunori Yagiura, Computers & Operations Research 37 (2010) 325-333
    Test instances: https://www.dropbox.com/s/d6iprpvpoayekq8/strip2.zip?dl=0

  • Local Search Algorithms for the Rectangle Packing Problem with General Spatial Costs
    S    hinji Imahori, Mutsunori Yagiura, Toshihide Ibaraki, Mathematical Programming 97 (2003) 543-569
    Test instances (area minimization): https://www.dropbox.com/s/5700h12ylr3ovr8/area.zip?dl=0
    Test instances (scheduling): https://www.dropbox.com/s/fhhmgmx1ogpakqm/large.zip?dl=0

  • Improved Local Search Algorithms for the Rectangle Packing Problem with General Spatial Costs
    S    hinji Imahori, Mutsunori Yagiura, Toshihide Ibaraki, European Journal of Operational Research 167 (2005) 48-67
    Test instances (area minimization): https://www.dropbox.com/s/5700h12ylr3ovr8/area.zip?dl=0
    Test instances (strip packing): https://www.dropbox.com/s/7gyt493090lg3ml/strip.zip?dl=0
    Test instances (scheduling): https://www.dropbox.com/s/fhhmgmx1ogpakqm/large.zip?dl=0

  • Local Search Algorithms for the Two-Dimensional Cutting Stock Problem with a Given Number of Different Patterns
    S. Imahori, M. Yagiura, S. Umetani, S. Adachi and T. Ibaraki, in T. Ibaraki, K. Nonobe, M. Yagiura (eds.): Metaheuristics: Progress as Real Problem Solvers (Springer, NY, 2005) 181-202.
    Test instances (2d cutting sto    ck): https://www.dropbox.com/s/9inbr6fygprse2z/2dcsp.zip?dl=0