LP models for bin packing and cutting stock problems
type: Item
instance of: scholarly article
title: LP models for bin packing and cutting stock problems
zbMATH Open document ID: 1059.90095
DOI: 10.1016/S0377-2217(02)00124-8
published in: European Journal of Operational Research
publication date: 2002-11-17T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 1829894
zbMATH Keywords: Bin packing
zbMATH Keywords: Cutting stock
author: José Valério de Carvalho
describes a project that uses: Bison
MaRDI profile type: Publication
cites work: Q3056948
cites work: Branch-and-price: Column generation for solving huge integer programs
cites work: An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
cites work: Exact solution of bin-packing problems using column generation and branch-and-bound
cites work: A note on ``Branch-and-price algorithms for the one-dimensional cutting stock problems''
cites work: A time indexed formulation of non-preemptive single machine scheduling problems
cites work: Q4955266
cites work: A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
cites work: Q5687193
cites work: A New Linear Programming Approach to the Cutting Stock Problem
cites work: A typology of cutting and packing problems
cites work: Q4178782
cites work: Cutting Stock, Linear Programming, Knapsacking, Dynamic Programming and Integer Programming, Some Interconnections
cites work: A Linear Programming Approach to the Cutting-Stock Problem
cites work: A Linear Programming Approach to the Cutting Stock Problem—Part II
cites work: Mathematical methods of organizing and planning production. English translation by Robert W. Campbell and W. H. Marlow
cites work: Q5630824
cites work: Q3993418
cites work: Q4040221
cites work: A comparison of two optimization procedures for 1- and 1\(1/2\)-dimensional cutting stock problems
cites work: A one-dimensional cutting stock problem in the aluminium industry and its solution
cites work: BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
cites work: Branch-and-price algorithms for the one-dimensional cutting stock problem
cites work: Solving binary cutting stock problems by column generation and branch- and-bound
cites work: Computational study of a column generation algorithm for bin packing and cutting stock problems
cites work: On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
cites work: An exact algorithm for IP column generation
cites work: Heuristics for the integer one-dimensional cutting stock problem: A computational study
full work available at URL: s0377-2217(02)00124-8
OpenAlex ID: W2127087935
Recommended article: Bin packing and cutting stock problems: mathematical models and exact algorithms
Recommended article: An LP-based approach to a two-stage cutting stock problem
Recommended article: Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems
Recommended article: An LP-based approach to cutting stock problems with multiple objectives
Recommended article: BPPLIB: a library for bin packing and cutting stock problems
Recommended article: Models and complexity of multibin packing problems
Recommended article: Solving bin packing problems using VRPSolver models
Recommended article: Lp-Based Method For The Multi-Sheet Cutting Stock Problem
Recommended article: An inexact bundle approach to cutting-stock problems
Recommended article: Q3705224
description: scientific article; zbMATH DE number 1829894