A Bin Packing Problem Solver
bpp_solver_dpp_wrapper
bpp_solver_sgl
bpp_solver
bpp_solver_dpp
bpp_viewer
bpp_viewer_single
bppSgl
create_bn_rgl_control
create_it_cube3d
create_it_rgl_control
gbp
gbp1d
gbp1d_solver_dpp
gbp2d
gbp2d_checkr
gbp2d_it_create_ktlist
gbp2d_solver_dpp
gbp2d_solver_dpp_filt
gbp2d_solver_dpp_prep_create_p
gbp2d_viewer
gbp2q
gbp2q_checkr
gbp2q_viewer
gbp3d
gbp3d_checkr
gbp3d_it_create_ktlist
gbp3d_solver_dpp
gbp3d_solver_dpp_filt
gbp3d_solver_dpp_prep_create_p
gbp3d_viewer
gbp3q
gbp3q_checkr
gbp3q_viewer
gbp4d
gbp4d_checkr
gbp4d_it_create_ktlist
gbp4d_solver_dpp
gbp4d_solver_dpp_filt
gbp4d_solver_dpp_prep_create_p
gbp4d_viewer
gbp4q
gbp4q_checkr
gbp4q_viewer
Ktlist2d
Ktlist3d
Ktlist4d
Basic infrastructure and several algorithms for 1d-4d bin packing problem. This package provides a set of c-level classes and solvers for 1d-4d bin packing problem, and an r-level solver for 4d bin packing problem, which is a wrapper over the c-level 4d bin packing problem solver. The 4d bin packing problem solver aims to solve bin packing problem, a.k.a container loading problem, with an additional constraint on weight. Given a set of rectangular-shaped items, and a set of rectangular-shaped bins with weight limit, the solver looks for an orthogonal packing solution such that minimizes the number of bins and maximize volume utilization. Each rectangular-shaped item i = 1, .. , n is characterized by length l_i, depth d_i, height h_i, and weight w_i, and each rectangular-shaped bin j = 1, .. , m is specified similarly by length l_j, depth d_j, height h_j, and weight limit w_j. The item can be rotated into any orthogonal direction, and no further restrictions implied.