A Linear Programming Approach to the Cutting-Stock Problem

Cited in

(only showing first 100 items - show all)

Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths
Practical methods for shape fitting and kinetic data structures using coresets
Long-term staffing based on qualification profiles
An inexact bundle variant suited to column generation
New lower bounds based on column generation and constraint programming for the pattern minimization problem
On the choice of explicit stabilizing terms in column generation
An effective solution for a real cutting stock problem in manufacturing plastic rolls
A computational evaluation of a general branch-and-price framework for capacitated network location problems
An integrated approach to the one-dimensional cutting stock problem in coronary stent manufacturing
A sublinear-time approximation scheme for bin packing
The one-dimensional cutting stock problem with due dates
Models and heuristic algorithms for a weighted vertex coloring problem
The one-dimensional cutting stock problem with usable leftover - a heuristic approach
New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
Trim-loss pattern rearrangement and its relevance to the flat-glass industry
A note on modifying a two-dimensional trim-loss algorithm to deal with cutting restrictions
Production planning and scheduling for an integrated container company
Vehicle routing via column generation
The cutting stock problem for large sections in the iron and steel industries
A 71/60 theorem for bin packing
Near-optimal solutions to one-dimensional cutting stock problems
A new approach for crew pairing problems by column generation with an application to air transportation
Practical adaptations of the Gilmore-Gomory approach to cutting stock problems
A comparison of two optimization procedures for 1- and 1\(1/2\)-dimensional cutting stock problems
A sequential heuristic procedure for one-dimensional cutting
The modified integer round-up property of the one-dimensional cutting stock problem
CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem
Nesting planning based on production priorities and technological efficiency
The trim-loss and assortment problems: A survey
A heuristic procedure for solving the quadratic assignment problem
Bin packing can be solved within 1+epsilon in linear time
Cutting stock problems and solution procedures
On the problem of multiple mobile robots cluttering a workspace
One-dimensional cutting stock problems and solution procedures
Composite stock cutting through simulated annealing
Limiting the number of each piece in two-dimensional cutting stock patterns
Knowledge based approach to the cutting stock problem
Packing problems
Selection of parts and machines for cellularization: A mathematical programming approach
Profit-based FMS dynamic part type selection over time for mid-term production planning
Stock cutting to minimize cutting length
A simulated annealing heuristic for the one-dimensional cutting stock problem
Crew pairing at Air France
A generalized linear programming model for nurse scheduling
A branch and bound algorithm for the resource-constrained project scheduling problem
The cutting stock problem with mixed objectives: Two heuristics based on dynamic programming
Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem
HOP: A software tool for production scheduling at Bridgestone/Firestone Off-The-Road
Simulated annealing for order spread minimization in sequencing cutting patterns
An algorithm for the 2D guillotine cutting stock problem
A real-time one-dimensional cutting stock algorithm for balanced cutting patterns
Solving binary cutting stock problems by column generation and branch- and-bound
Solution procedures for cutting lumber into furniture parts
Procedures for solving a 1-dimensional cutting problem
Multiple-type, two-dimensional bin packing problems: Applications and algorithms
A column generation approach to job grouping for flexible manufacturing systems
An algorithm for the determination of optimal cutting patterns
An exact algorithm for IP column generation
Effective methods for a container packing operation
A branch-and-price algorithm for solving the cutting strips problem
Cluster analysis and mathematical programming
Optimization of roll cutting in clothing industry
Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem
The tolerance approach in multiobjective linear fractional programming
Improved heuristics for sequencing cutting patterns
Column generation applied to linear programs in course registration
Algorithms for the item assortment problem: an application to vending machine products
The cutting stock problem in a hardboard industry: A case study.
A new model for complete solutions to one-dimensional cutting stock problems.
Improving competitiveness in veneers production by a simple-to-use DSS.
A column generation approach to capacitated p-median problems
The shortest path problem with forbidden paths
Scheduling no-wait robotic cells with two and three machines
Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems
Row and column generation technique for a multistage cutting stock problem
Evaluation of algorithms for one-dimensional cutting
Families of non-IRUP instances of the one-dimensional cutting stock problem
Application of optimization for solving a sawing stock problem with a cant sawing pattern
A column generation approach and new bounds for the car sequencing problem
The integrated lot sizing and cutting stock problem with saw cycle constraints applied to furniture production
Testing probabilistic models of choice using column generation
Exact algorithms for the bin packing problem with fragile objects
The skiving stock problem and its relation to hypergraph matchings
Two-dimensional cutting stock problem with sequence dependent setup times
Linear fractional approximations for master problems in column generation
Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case
An empirical analysis of exact algorithms for the unbounded knapsack problem
Integer rounding and modified integer rounding for the skiving stock problem
The value of integrating loading and routing
A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems
Mathematical models and decomposition methods for the multiple knapsack problem
The min-conflict packing problem
LP bounds in various constraint programming approaches for orthogonal packing
Efficient algorithms for real-life instances of the variable size bin packing problem
Exact algorithms for the two-dimensional guillotine knapsack
Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing
A branch-and-price approach to p-median location problems
A cutting stock problem and its solution in the manufacturing industry of large electric generators
A combined approach to the solution to the general one-dimensional cutting stock problem
Orbital shrinking: theory and applications

This page was built for publication: A Linear Programming Approach to the Cutting-Stock Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3275357)