A Linear Programming Approach to the Cutting Stock Problem—Part II

Cited in

(only showing first 100 items - show all)

Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths
An effective solution for a real cutting stock problem in manufacturing plastic rolls
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
Ranking of vertices in the linear fractional programming problem
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
A new enumeration scheme for the knapsack problem
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
Cutting planes and column generation techniques with the projective algorithm
A sequential heuristic procedure for one-dimensional cutting
An LP-based approach to a two-stage cutting stock problem
Nesting planning based on production priorities and technological efficiency
Bounds for nested knapsack problems
The trim-loss and assortment problems: A survey
Fractional programming: Applications and algorithms
An extension of a greedy heuristic for the knapsack problem
Cutting stock problems and solution procedures
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
A complementary greedy heuristic for the knapsack problem
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 real-time one-dimensional cutting stock algorithm for balanced cutting patterns
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
An algorithm for the determination of optimal cutting patterns
An exact algorithm for IP column generation
Effective methods for a container packing operation
Optimization of roll cutting in clothing industry
Improved heuristics for sequencing cutting patterns
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
Unbounded knapsack problem: Dynamic programming revisited
Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems
Fuzzy mathematical programming for multi objective linear fractional programming problem
Row and column generation technique for a multistage cutting stock problem
Evaluation of algorithms for one-dimensional cutting
The integrated lot sizing and cutting stock problem with saw cycle constraints applied to furniture production
Finding the efficiency status and efficient projection in multiobjective linear fractional programming: a linear programming technique
Exact algorithms for the bin packing problem with fragile objects
Fractional 0-1 programming: applications and algorithms
Two-dimensional cutting stock problem with sequence dependent setup times
A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems
An empirical analysis of exact algorithms for the unbounded knapsack problem
A column generation approach for the integrated shift and task scheduling problem of logistics assistants in hospitals
The min-conflict packing problem
Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing
A branch-and-price approach to p-median location problems
A combined approach to the solution to the general one-dimensional cutting stock problem
Exact and hybrid methods for the multiperiod field service routing problem
Interior efficient solutions in bicriterion linear fractional programming -- A geometric approach
A hierarchical approach for one-dimensional cutting stock problems in the steel industry that maximizes yield and minimizes overgrading
The finite criss-cross method for hyperbolic programming
A hybrid approach for optimization of one-dimensional cutting
A one-dimensional cutting stock problem in the aluminium industry and its solution
One-dimensional cutting stock decisions for rolls with multiple quality grades
Selection of stockplate characteristics and cutting style for two dimensional cutting stock situations
The cutting stock problem in the canvas industry
Optimal solutions for the cutting stock problem
Load planning for shipments of low density products
Two-dimensional packing problems: a survey
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
Modeling multistage cutting stock problems
A solution procedure for a pattern sequencing problem as part of a one-dimensional cutting stock problem in the steel industry
One-dimensional cutting stock problem to minimize the number of different patterns
Cutting aluminium coils with high length variabilities
Smart greedy procedure for solving a nonlinear knapsack class of reliability optimization problems
Heuristics for the integer one-dimensional cutting stock problem: A computational study
Interactive procedures in large-scale two-dimensional cutting stock problems
On a fractional minimal cost flow problem on networks
A prototype column generation strategy for the multiple container loading problem
Pattern minimisation in cutting stock problems
A combined cutting-stock and lot-sizing problem
A heuristic for the problem of one-dimensional steel coil cutting
Characterizing the optimality gap and the optimal packings for the bin packing problem
Modified greedy heuristic for the one-dimensional cutting stock problem
The integrated lot sizing and cutting stock problem in an automotive spring factory
New exact techniques applied to a class of network flow formulations
An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems
A residual recombination heuristic for one-dimensional cutting stock problems

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

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