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

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, A note on handling residual lengths, List-scheduling and column-generations for scheduling of n job-groups with set up time and due date through m identical parallel machines to minimize makespan, Search method for solving general integer programming problems, Heuristic algorithms based on column generation for an online product shipping problem, Fifty Years of OR in Forestry Preface to the Special Forestry Issue of INFOR, A stochastic programming approach to the cutting stock problem with usable leftovers, A reinforcement learning approach to the stochastic cutting stock problem, Progressive Selection Method for the Coupled Lot-Sizing and Cutting-Stock Problem, Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model, The cutting stock problem applied to the hardening process in an automotive spring factory, Relaxation techniques applied to some loading problems, Unnamed Item, Submodularity in Conic Quadratic Mixed 0–1 Optimization, Deriving compact extended formulations via LP-based separation techniques, Fractional programming, O problema de corte de estoque em indústrias de móveis de pequeno e médio portes, A Heuristic Solution of a Cutting Problem Using Hypergraphs, Deriving compact extended formulations via LP-based separation techniques, The usable leftover one‐dimensional cutting stock problem—a priority‐in‐use heuristic, Analysis and modelling of a production line in a corrugated box factory, A sliding algorithm for optimal nesting of arbitrarily shaped sheet metal blanks, Lower bounds and algorithms for the 2-dimensional vector packing problem, Analysis of upper bounds for the pallet loading problem, An algorithm for determining the K-best solutions of the one-dimensional Knapsack problem, A branch-and-bound algorithm for solving a fixed charge problem in the profit optimization of sawn timber production, Streaming algorithms for bin packing and vector scheduling, Column-Generation in Integer Linear Programming, Glass cutting in a small firm, Approximation algorithms for combinatorial fractional programming problems, Equivalence of various linearization algorithms for linear fractional programming, Unnamed Item, Soft OR and Practice: The Contribution of the Founders of Operations Research, A new method for solving fuzzy linear fractional programming problems, A residual recombination heuristic for one-dimensional cutting stock problems, Distributed Optimization in Networking: Recent Advances in Combinatorial and Robust Formulations, Cutting aluminium coils with high length variabilities, An improved typology of cutting and packing problems, A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem, The one dimensional Compartmentalised Knapsack problem: a case study, Models and algorithms for three-stage two-dimensional bin packing, A note on the approximability of cutting stock problems, Accelerating column generation for variable sized bin-packing problems, An integrated cutting stock and sequencing problem, Alternative configurations for cutting machines in a tube cutting mill, Roll cutting in the curtain industry, or: a well-solvable allocation problem, Optimising the cutting of wood fibre plates in the hardboard industry, An optimization model for trim loss minimization in an automotive glass plant, Smart greedy procedure for solving a nonlinear knapsack class of reliability optimization problems, Finding the efficiency status and efficient projection in multiobjective linear fractional programming: a linear programming technique, Arc-flow model for the two-dimensional guillotine cutting stock problem, Exact algorithms for the bin packing problem with fragile objects, Ameso optimization: a relaxation of discrete midpoint convexity, Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost, Untersuchungen zu speziellen linearen gemischt-ganzzahligen 0-1-optimierungsaufgaben, Heuristics for the integer one-dimensional cutting stock problem: A computational study, Interactive procedures in large-scale two-dimensional cutting stock problems, Simultaneously exploiting two formulations: an exact Benders decomposition approach, An approach to two-dimensional cutting stock problems, Fractional 0-1 programming: applications and algorithms, On a fractional minimal cost flow problem on networks, A prototype column generation strategy for the multiple container loading problem, Two-dimensional cutting stock problem with sequence dependent setup times, Exact and approximate methods for the score-constrained packing problem, Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation, Integrated lot-sizing and one-dimensional cutting stock problem with usable leftovers, Minimizing setups and waste when printing labels of consumer goods, A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems, Exact solution of network flow models with strong relaxations, An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem, Cutting uncertain stock and vehicle routing in a sustainability forestry harvesting problem, Pattern minimisation in cutting stock problems, A combined cutting-stock and lot-sizing problem, Solving Large Scale Optimization Problems in the Transportation Industry and Beyond Through Column Generation, An empirical analysis of exact algorithms for the unbounded knapsack problem, An enumeration scheme to generate constrained exact checkerboard patterns, A heuristic for the problem of one-dimensional steel coil cutting, On LP relaxations for the pattern minimization problem, A model to optimize placement operations on dual-head placement machines, An exact model for a slitting problem in the steel industry, Arc flow formulations based on dynamic programming: theoretical foundations and applications, Formulations and exact algorithms for the vehicle routing problem with time windows, Solution methods for scheduling problems with sequence-dependent deterioration and maintenance events, An extended goal programming model for the multiobjective integrated lot-sizing and cutting stock problem, Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement, 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, Simultaneously determining the mix of space launch vehicles and the assignment of satellites to rockets, Characterizing the optimality gap and the optimal packings for the bin packing problem, Merging the local and global approaches to probabilistic satisfiability, A combined approach to the solution to the general one-dimensional cutting stock problem, One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming, Capacity and assortment planning under one-way supplier-driven substitution for pharmacy kiosks with low drug demand, Exact and hybrid methods for the multiperiod field service routing problem, The one-dimensional cutting stock problem with sequence-dependent cut losses, One-dimensional cutting stock with a limited number of open stacks: bounds and solutions from a new integer linear programming model, Solving the linear fractional programming problem in a fuzzy environment: numerical approach, Dual Inequalities for Stabilized Column Generation Revisited, Heurísticas para os problemas de geração e sequenciamento de padrões de corte bidimensionais, Rank-Cluster-and-Prune: An algorithm for generating clusters in complex set partitioning problems, Interior efficient solutions in bicriterion linear fractional programming -- A geometric approach, Modified greedy heuristic for the one-dimensional cutting stock problem, 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, An algorithm for the computation of knapsack functions, The integrated lot sizing and cutting stock problem in an automotive spring factory, New exact techniques applied to a class of network flow formulations, Analysis of the solution to a linear fractional functionals programming, 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, Solution of a fractional combinatorial optimization problem by mixed integer programming, The two-dimensional bin packing problem with variable bin sizes and costs, Approximate and exact algorithms for the fixed-charge knapsack problem, Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem, 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, An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems, A branch-and-price algorithm for the temporal bin packing problem, A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting, Friendly bin packing instances without integer round-up property, Bibliography in fractional programming, One-dimensional cutting stock problem to minimize the number of different patterns, The one-dimensional cutting stock problem with usable leftovers -- a survey