Solving binary cutting stock problems by column generation and branch- and-bound
From MaRDI portal
Publication:1326509
DOI10.1007/BF01300970zbMath0801.90080MaRDI QIDQ1326509
Nemhauser, George I., Ellis L. Johnson, Cynthia Barnhart, Pamela H. Vance
Publication date: 18 May 1994
Published in: Computational Optimization and Applications (Search for Journal in Brave)
90C10: Integer programming
90C09: Boolean programming
90-08: Computational methods for problems pertaining to operations research and mathematical programming
Related Items
Column-Generation in Integer Linear Programming, Unnamed Item, Strategic capacity planning in supply chain design for a new market opportunity, Scenario-based approach for flexible resource loading under uncertainty, A column generation approach for the maximal covering location problem, Integer programming approach to the printed circuit board grouping problem, Lower bounds and algorithms for the 2-dimensional vector packing problem, Multi-commodity supply network planning in the forest supply chain, The one-dimensional cutting stock problem with due dates, Cliques and clustering: A combinatorial approach, Properties of some ILP formulations of a class of partitioning problems, Locomotive assignment with heterogeneous consists at CN North America, An exact algorithm for IP column generation, A branch-and-price algorithm for solving the cutting strips problem, A column generation approach to capacitated \(p\)-median problems, The asymmetric traveling salesman problem with replenishment arcs, Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems, A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem, A branch-and-price approach to \(p\)-median location problems, LP models for bin packing and cutting stock problems, Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths, Ranking lower bounds for the bin-packing problem, Computational results with a primal-dual subproblem simplex method, A branch-and-price approach for operational aircraft maintenance routing, Bi-dynamic constraint aggregation and subproblem reduction, A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting, An improved typology of cutting and packing problems, Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems, One-dimensional relaxations and LP bounds for orthogonal packing, The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP, Exact Solution of Cutting Stock Problems Using Column Generation and Branch-and-Bound
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Methods for routing with time windows
- An instance of the cutting stock problem for which the rounding property does not hold
- Near-optimal solutions to one-dimensional cutting stock problems
- A note on the knapsack problem with special ordered sets
- Cutting stock problems and solution procedures
- The pickup and delivery problem with time windows
- A polyhedral approach to edge coloring
- MINTO, a Mixed INTeger Optimizer
- An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment
- A one-dimensional cutting stock problem in the aluminium industry and its solution
- Optimal solutions for the cutting stock problem
- A Linear Programming Approach to the Cutting-Stock Problem
- Routing with time windows by column generation
- The cutting stock problem and integer rounding
- A Column Generation Approach to the Urban Transit Crew Scheduling Problem
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- Computing Partitions with Applications to the Knapsack Problem
- A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems
