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.

Version: | 0.1.0.4 |

Depends: | R (≥ 3.0.0), magrittr, data.table |

Imports: | methods, rgl, Rcpp (≥ 0.12.7) |

LinkingTo: | Rcpp, RcppArmadillo |

Suggests: | testthat, knitr, rmarkdown |

Published: | 2017-01-28 |

Author: | Guang Yang |

Maintainer: | Guang Yang <gyang274 at gmail.com> |

BugReports: | https://github.com/gyang274/gbp/issues |

License: | MIT + file LICENSE |

URL: | https://github.com/gyang274/gbp |

NeedsCompilation: | yes |

SystemRequirements: | C++11, GNU make |

CRAN checks: | gbp results |

Reference manual: | gbp.pdf |

Vignettes: |
gbp: a bin packing problem solver. |

Package source: | gbp_0.1.0.4.tar.gz |

Windows binaries: | r-devel: gbp_0.1.0.4.zip, r-release: gbp_0.1.0.4.zip, r-oldrel: gbp_0.1.0.4.zip |

OS X Mavericks binaries: | r-release: gbp_0.1.0.4.tgz, r-oldrel: gbp_0.1.0.4.tgz |

Please use the canonical form
`https://CRAN.R-project.org/package=gbp`
to link to this page.