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

DOI10.1287/OPRE.11.6.863zbMath0124.36307OpenAlexW2085478109WikidataQ96292127 ScholiaQ96292127MaRDI QIDQ5328572

Paul C. Gilmore, Ralph E. Gomory

Publication date: 1963

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.11.6.863

zbMATH Keywords

operations research

Related Items (only showing first 100 items - show all)

Solution procedures for cutting lumber into furniture parts ⋮ Mathematical models and a heuristic method for the multiperiod one-dimensional cutting stock problem ⋮ Interval linear fractional programming: optimal value range of the objective function ⋮ Procedures for solving a 1-dimensional cutting problem ⋮ A 71/60 theorem for bin packing ⋮ An exact scalarization method with multiple reference points for bi-objective integer linear optimization problems ⋮ Routing of uncertain traffic demands ⋮ Multiple-type, two-dimensional bin packing problems: Applications and algorithms ⋮ A new enumeration scheme for the knapsack problem ⋮ An algorithm for the determination of optimal cutting patterns ⋮ Origin and early evolution of corner polyhedra ⋮ Bin packing and cutting stock problems: mathematical models and exact algorithms ⋮ 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 ⋮ An exact algorithm for IP column generation ⋮ Effective methods for a container packing operation ⋮ A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems ⋮ The integrated lot sizing and cutting stock problem with saw cycle constraints applied to furniture production ⋮ One-dimensional cutting stock optimization in consecutive time periods ⋮ Solution approaches for the cutting stock problem with setup cost ⋮ Determining the \(K\)-best solutions of knapsack problems ⋮ Optimization of roll cutting in clothing industry ⋮ The constrained compartmentalised knapsack problem ⋮ A matrix generation approach for eigenvalue optimization ⋮ Cutting planes and column generation techniques with the projective algorithm ⋮ A sequential heuristic procedure for one-dimensional cutting ⋮ A branch-and-price algorithm to solve the molten iron allocation problem in iron and steel industry ⋮ An LP-based approach to a two-stage cutting stock problem ⋮ New bin packing fast lower bounds ⋮ Nesting planning based on production priorities and technological efficiency ⋮ Bounds for nested knapsack problems ⋮ On the cutting stock problem under stochastic demand ⋮ A survey of dual-feasible and superadditive functions ⋮ A linear programming approach to test efficiency in multi-objective linear fractional programming problems ⋮ Improved heuristics for sequencing cutting patterns ⋮ Lower and upper bounds for the bin packing problem with fragile objects ⋮ The trim-loss and assortment problems: A survey ⋮ The constrained compartmentalized knapsack problem: mathematical models and solution methods ⋮ Fractional programming: Applications and algorithms ⋮ Tight bounds for periodicity theorems on the unbounded knapsack problem ⋮ The cutting stock problem in a hardboard industry: A case study. ⋮ Optimization of occupancy rate in dial-a-ride problems via linear fractional column generation ⋮ A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size ⋮ On the one-dimensional stock cutting problem in the paper tube industry ⋮ An exact algorithm for large unbounded knapsack problems ⋮ A new model for complete solutions to one-dimensional cutting stock problems. ⋮ A linear optimization approach to the combined production planning model ⋮ Improving competitiveness in veneers production by a simple-to-use DSS. ⋮ Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation ⋮ Characterization and modelling of guillotine constraints ⋮ A column generation approach to capacitated \(p\)-median problems ⋮ An extension of a greedy heuristic for the knapsack problem ⋮ Cutting stock problems and solution procedures ⋮ Turning restriction design in traffic networks with a budget constraint ⋮ A coupling cutting stock-lot sizing problem in the paper industry ⋮ A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem ⋮ An improved approximation scheme for variable-sized bin packing ⋮ A discrete dynamic convexized method for nonlinear integer programming ⋮ 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 ⋮ The double pivot simplex method ⋮ Packing problems ⋮ An integer programming approach to generating airline crew pairings ⋮ A complementary greedy heuristic for the knapsack problem ⋮ Polylithic modeling and solution approaches using algebraic modeling systems ⋮ Recent advances on two-dimensional bin packing problems ⋮ A column generation method for the multiple-choice multi-dimensional knapsack problem ⋮ Integrating process optimization and inventory planning in cutting-stock with skiving option: an optimization model and its application ⋮ A branch-and-price algorithm for placement routing for a multi-head beam-type component placement tool ⋮ Column generation decomposition with the degenerate constraints in the subproblem ⋮ Classification and literature review of integrated lot-sizing and cutting stock problems ⋮ Algorithms for the one-dimensional two-stage cutting stock problem ⋮ Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths ⋮ Stock cutting to minimize cutting length ⋮ A simulated annealing heuristic for the one-dimensional cutting stock problem ⋮ An algorithm for the two-dimensional assortment problem ⋮ 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 ⋮ Crew pairing at Air France ⋮ Unbounded knapsack problem: Dynamic programming revisited ⋮ 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 ⋮ Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems ⋮ A generalized linear programming model for nurse scheduling ⋮ 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 ⋮ Heuristics for sequencing cutting patterns ⋮ 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 ⋮ A real-time one-dimensional cutting stock algorithm for balanced cutting patterns

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