A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint
type: Item
instance of: scholarly article
title: A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint
zbMATH Open document ID: 1201.90168
author: Andrea Bettinelli
author: Alberto Ceselli
author: Giovanni Righini
published in: Annals of Operations Research
publication date: 2010-12-13T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 5826010
zbMATH Keywords: bin packing
zbMATH Keywords: column generation
zbMATH Keywords: branch-and-price
describes a project that uses: Knapsack
describes a project that uses: CPLEX
describes a project that uses: SCIP
MaRDI profile type: Publication
full work available at URL: s10479-008-0452-9
OpenAlex ID: W2030744036
cites work: Accelerating column generation for variable sized bin-packing problems
cites work: A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem
cites work: A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths
cites work: Ship routing and scheduling with flexible cargo sizes
cites work: Column generation approaches to ship scheduling with flexible cargo sizes
cites work: A local-search-based heuristic for the demand-constrained multidimensional knapsack problem
cites work: Variable-sized bin packing: Tight absolute worst-case performance ratios for four approximation algorithms
cites work: Solving the variable size bin packing problem with discretized formulations
cites work: Variable Sized Bin Packing
cites work: A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem
cites work: Algorithms for the variable sized bin packing problem
cites work: Models and bounds for two-dimensional level packing problems
cites work: Q3993418
cites work: Algorithms for packing and scheduling problems. (Abstract of thesis)
cites work: Anomalous behavior in bin packing algorithms
cites work: A Minimal Algorithm for the Bounded Knapsack Problem
cites work: Using extra dual cuts to accelerate column generation
DOI: 10.1007/S10479-008-0452-9
description: scientific article; zbMATH DE number 5826010