A branch-and-price algorithm for the two-dimensional level strip packing problem
type: Item
instance of: scholarly article
title: A branch-and-price algorithm for the two-dimensional level strip packing problem
zbMATH Open document ID: 1168.90577
author: Andrea Bettinelli
author: Alberto Ceselli
author: Giovanni Righini
published in: 4OR
publication date: 2009-07-13T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 5577673
describes a project that uses: Knapsack
MaRDI profile type: Publication
full work available at URL: s10288-007-0051-7
OpenAlex ID: W2032180390
cites work: Two-Dimensional Finite Bin-Packing Algorithms
cites work: Two exact algorithms for the capacitated \(p\)-median problem
cites work: An optimization algorithm for a penalized knapsack problem
cites work: Column Generation
cites work: Q4398379
cites work: A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing
cites work: A general framework for bounds for higher-dimensional orthogonal packing problems.
cites work: Q4198056
cites work: A near-optimal solution to a two-dimensional cutting stock problem
cites work: Two-dimensional packing problems: a survey
cites work: Recent advances on two-dimensional bin packing problems
cites work: Models and bounds for two-dimensional level packing problems
cites work: An exact approach to the strip-packing problem
cites work: Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
cites work: Q3993418
cites work: A Minimal Algorithm for the 0-1 Knapsack Problem
DOI: 10.1007/S10288-007-0051-7
description: scientific article; zbMATH DE number 5577673