BPPLIB: a library for bin packing and cutting stock problems
type: Item
instance of: scholarly article
title: BPPLIB: a library for bin packing and cutting stock problems
zbMATH Open document ID: 1401.90183
author: Maxence Delorme
author: Manuel Iori
author: Silvano Martello
published in: Optimization Letters
publication date: 2018-04-19T00:00:00Z
full work available at URL: http://hdl.handle.net/11585/683159
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6861693
zbMATH Keywords: bin packing
zbMATH Keywords: cutting stock
zbMATH Keywords: computer codes
zbMATH Keywords: benchmark instances
zbMATH Keywords: surveys
describes a project that uses: OR-Library
describes a project that uses: CVRPSEP
describes a project that uses: Bison
describes a project that uses: MIPLIB
describes a project that uses: QAPLIB
describes a project that uses: Concorde
describes a project that uses: SCIP
describes a project that uses: VRPH
describes a project that uses: CPLEX
describes a project that uses: libcgrpp
describes a project that uses: SimCList
describes a project that uses: CVRPSP
describes a project that uses: CBLIB
describes a project that uses: CUTGEN1
MaRDI profile type: Publication
OpenAlex ID: W2753452838
cites work: Q3425132
cites work: A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
cites work: Q4141851
cites work: Bin packing and related problems: general arc-flow formulation with graph compression
cites work: QAPLIB-A quadratic assignment problem library
cites work: QAPLIB - a quadratic assignment problem library
cites work: Dual inequalities for stabilized column generation revisited
cites work: Friendly bin packing instances without integer round-up property
cites work: Q3347319
cites work: Bin packing and cutting stock problems: mathematical models and exact algorithms
cites work: A New Linear Programming Approach to the Cutting Stock Problem
cites work: A typology of cutting and packing problems
cites work: CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization
cites work: Q4198056
cites work: CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem
cites work: A library of local search heuristics for the vehicle routing problem
cites work: A new branch-and-cut algorithm for the capacitated vehicle routing problem
cites work: Q3993418
cites work: BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
cites work: The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP
cites work: A Python/C library for bound-constrained global optimization with continuous GRASP
cites work: Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
cites work: New benchmark instances for the capacitated vehicle routing problem
cites work: Exact solution of bin-packing problems using column generation and branch-and-bound
cites work: LP models for bin packing and cutting stock problems
cites work: Heuristics for the integer one-dimensional cutting stock problem: A computational study
cites work: An improved typology of cutting and packing problems
DOI: 10.1007/S11590-017-1192-Z
description: scientific article; zbMATH DE number 6861693