BPPLIB: a library for bin packing and cutting stock problems
From MaRDI portal
Publication:1746064
DOI10.1007/s11590-017-1192-zzbMath1401.90183OpenAlexW2753452838MaRDI QIDQ1746064
Maxence Delorme, Manuel Iori, Silvano Martello
Publication date: 19 April 2018
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11585/683159
Related Items
Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem, Capping methods for the automatic configuration of optimization algorithms, Cutting and packing problems under uncertainty: literature review and classification framework, Heuristic algorithms based on column generation for an online product shipping problem, Lower and upper bounding procedures for the bin packing problem with concave loading cost, Ejection chain moves for automatic neighborhood synthesis in constrained cardinality‐minimization problems, Mathematical models for the two-dimensional variable-sized cutting stock problem in the home textile industry, The transportation problem with packing constraints, Exact solution of network flow models with strong relaxations, The Meet-in-the-Middle Principle for Cutting and Packing Problems, Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems, An empirical analysis of exact algorithms for the unbounded knapsack problem, New symmetry-less ILP formulation for the classical one dimensional bin-packing problem, Exact solution techniques for two-dimensional cutting and packing, A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems, BPPLIB, Improved flow-based formulations for the skiving stock problem, A branch-and-price algorithm for the temporal bin packing problem, 2DPackLib: a two-dimensional cutting and packing library
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- Bin packing and related problems: general arc-flow formulation with graph compression
- A library of local search heuristics for the vehicle routing problem
- QAPLIB-A quadratic assignment problem library
- CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem
- Exact solution of bin-packing problems using column generation and branch-and-bound
- QAPLIB - a quadratic assignment problem library
- BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
- New benchmark instances for the capacitated vehicle routing problem
- A typology of cutting and packing problems
- LP models for bin packing and cutting stock problems
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- Heuristics for the integer one-dimensional cutting stock problem: A computational study
- Friendly bin packing instances without integer round-up property
- A Python/C library for bound-constrained global optimization with continuous GRASP
- A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
- An improved typology of cutting and packing problems
- Dual Inequalities for Stabilized Column Generation Revisited
- The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP
- A New Linear Programming Approach to the Cutting Stock Problem
- Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
