The generalized assortment and best cutting stock length problems

DOI10.1111/J.1475-3995.2009.00724.XzbMath1213.90182OpenAlexW2144560467WikidataQ56432359 ScholiaQ56432359MaRDI QIDQ3002687

John F. Raffensperger

Publication date: 23 May 2011

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/j.1475-3995.2009.00724.x

zbMATH Keywords

production

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items (1)

A cutting stock problem in the wood products industry: a two‐stage solution approach

Uses Software

• AMPL

Cites Work

• A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem
• A combined approach to the solution to the general one-dimensional cutting stock problem
• LP models for bin packing and cutting stock problems
• A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths
• Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths
• A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
• Optimal Integer Solutions to Industrial Cutting-Stock Problems: Part 2, Benchmark Results
• A Decomposition-Based Pricing Procedure for Large-Scale Linear Programs: An Application to the Linear Multicommodity Flow Problem
• A Linear Programming Approach to the Cutting-Stock Problem
• A New Linear Programming Approach to the Cutting Stock Problem
• Exact Solution of Cutting Stock Problems Using Column Generation and Branch-and-Bound

This page was built for publication: The generalized assortment and best cutting stock length problems