Solving binary cutting stock problems by column generation and branch- and-bound
type: Item
instance of: scholarly article
title: Solving binary cutting stock problems by column generation and branch- and-bound
zbMATH Open document ID: 0801.90080
DOI: 10.1007/BF01300970
author: Pamela H. Vance
author: Cynthia Barnhart
author: Ellis L. Johnson
author: G. L. Nemhauser
published in: Computational Optimization and Applications
publication date: 1994-05-18T00:00:00Z
Mathematics Subject Classification ID: 90C09
Mathematics Subject Classification ID: 90-08
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 569205
zbMATH Keywords: binary cutting stock problem
zbMATH Keywords: column generation
zbMATH Keywords: branch-and-bound
describes a project that uses: MINTO
MaRDI profile type: Publication
cites work: A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
cites work: A Column Generation Approach to the Urban Transit Crew Scheduling Problem
cites work: Routing with time windows by column generation
cites work: Methods for routing with time windows
cites work: The pickup and delivery problem with time windows
cites work: A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems
cites work: Q4198056
cites work: A Linear Programming Approach to the Cutting-Stock Problem
cites work: Optimal solutions for the cutting stock problem
cites work: Cutting stock problems and solution procedures
cites work: Computing Partitions with Applications to the Knapsack Problem
cites work: A note on the knapsack problem with special ordered sets
cites work: The cutting stock problem and integer rounding
cites work: An instance of the cutting stock problem for which the rounding property does not hold
cites work: Q3993418
cites work: A polyhedral approach to edge coloring
cites work: An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment
cites work: Near-optimal solutions to one-dimensional cutting stock problems
cites work: MINTO, a Mixed INTeger Optimizer
cites work: A one-dimensional cutting stock problem in the aluminium industry and its solution
full work available at URL: https://doi.org/10.1007/bf01300970
OpenAlex ID: W2005926129
description: scientific article; zbMATH DE number 569205