Free available software of the CaPaD-group
(If you need anything from our publications not findable in this list, feel free to contact us).
For test instances, go there.

Orthogonal packing feasibility and conservative scales for 1D and higher-dimensional orthogonal packing
Author: Gleb Belov
Download: GNU C++ 4.x source, zipped (500 KB)     Updated on 2013/02/21 (2-cliques fixed)
Publications:

1D stock cutting, pattern minimization, open stacks minimization, node-flow model, arc-flow model;
2D two-stage guillotine cutting

Author: Gleb Belov
Download: GNU C++ 4.x source, some test data, zipped (2.8 MB)
UPDATED on 11.03.18: In case of "unscaled infeasibilities" in CPLEX, resolve LP from scratch
UPDATED on 30.10.14: Added UpperCutoff in MIP rounding. MIPs have no branching constr and always Ax>=b formulation
UPDATED on 02.10.14: Tighter LP tolerances, incl. those for CPLEX (see README), updated bookkeeping for early termination
Publications:

1D stock cutting with multiple stock lengths
Author: Gleb Belov
Download: GNU C++ 4.x source and Linux executables, .tar.gz (0.5 MB)
Publication: A Cutting Plane Algorithm for the One-Dimensional Cutting Stock Problem with Multiple Stock Lengths

SVC heuristic for 2D orthogonal strip-packing without rotations
Author: Gleb Belov
Download: GNU C++ 4.x source and Linux executable, MS Visual C++ 1998 .prj and .exe, test data, zipped (4 MB)
Publication: One-Dimensional Heuristics Adapted for Two-Dimensional Rectangular Strip Packing


[ Members | Publications | Services | Links | Home | email ]

DEMO: The G4-Heuristic for the Pallet Loading Problem
Author: Guntram Scheithauer
Download: DOS executable, zipped (40 kb)
Info: Readme
Publication: The G4-Heuristic for the Pallet Loading Problem (JORS 47, 1996)
[ Members | Services | Publications | Links | Home | email ]