A Linear Programming Approach to the Cutting-Stock Problem

DOI10.1287/opre.9.6.849zbMath0096.35501OpenAlexW2144946856MaRDI QIDQ3275357

Paul C. Gilmore, Ralph E. Gomory

Publication date: 1961

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

Full work available at URL: https://semanticscholar.org/paper/141764b5e86dc6c2647dfce48098794c79d5a38b

zbMATH Keywords

applications of probability theory and statistics

Related Items

Families of non-IRUP instances of the one-dimensional cutting stock problem, 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, Application of optimization for solving a sawing stock problem with a cant sawing pattern, An algorithm for the determination of optimal cutting patterns, A column generation approach and new bounds for the car sequencing problem, 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, An exact algorithm for IP column generation, Effective methods for a container packing operation, The integrated lot sizing and cutting stock problem with saw cycle constraints applied to furniture production, Testing probabilistic models of choice using column generation, A branch-and-price algorithm for solving the cutting strips problem, Cluster analysis and mathematical programming, Optimization of roll cutting in clothing industry, Exact algorithms for the bin packing problem with fragile objects, The skiving stock problem and its relation to hypergraph matchings, Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem, A sequential heuristic procedure for one-dimensional cutting, The tolerance approach in multiobjective linear fractional programming, 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, A faster FPTAS for the unbounded knapsack problem, Nesting planning based on production priorities and technological efficiency, Two-dimensional cutting stock problem with sequence dependent setup times, 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 trim-loss and assortment problems: A survey, The cutting stock problem in a hardboard industry: A case study., A heuristic procedure for solving the quadratic assignment problem, A new model for complete solutions to one-dimensional cutting stock problems., Bin packing can be solved within 1+epsilon in linear time, Improving competitiveness in veneers production by a simple-to-use DSS., Linear fractional approximations for master problems in column generation, A column generation approach to capacitated \(p\)-median problems, Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case, Cutting stock problems and solution procedures, An empirical analysis of exact algorithms for the unbounded knapsack problem, 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, Integer rounding and modified integer rounding for the skiving stock problem, Packing problems, 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, 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, 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, Exact and hybrid methods for the multiperiod field service routing problem, Tighter relaxations for the cutting stock problem, A hierarchical approach for one-dimensional cutting stock problems in the steel industry that maximizes yield and minimizes overgrading, A hybrid approach for optimization of one-dimensional cutting, Stock cutting to minimize cutting length, A simulated annealing heuristic for the one-dimensional cutting stock problem, Crew pairing at Air France, An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment, A two-phase roll cutting problem, A one-dimensional cutting stock problem in the aluminium industry and its solution, A typology of cutting and packing problems, 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, An LP-based approach to cutting stock problems with multiple objectives, Optimal solutions for the cutting stock problem, Scheduling no-wait robotic cells with two and three machines, Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems, 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, A genetic algorithm solution for one-dimensional bundled stock cutting, Two-dimensional packing problems: a survey, 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, 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, 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, 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, One-dimensional cutting stock problem to minimize the number of different patterns, Algorithms for the variable sized bin packing problem, Large-scale optimization with the primal-dual column generation method, An analysis of the integrated lot-sizing and cutting-stock problem formulation, Mathematical models and a heuristic method for the multiperiod one-dimensional cutting stock problem, A 71/60 theorem for bin packing, Decomposition-based heuristic for the zoning and crop planning problem with adjacency constraints, An exact scalarization method with multiple reference points for bi-objective integer linear optimization problems, Tightness of sensitivity and proximity bounds for integer linear programs, A comparison of five heuristics for the multiple depot vehicle scheduling problem, Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges, Optimal relay node placement in delay constrained wireless sensor network design, Near-optimal solutions to one-dimensional cutting stock problems, Huge tables and multicommodity flows are fixed-parameter tractable via unimodular integer Carathéodory, A generalization of column generation to accelerate convergence, Scheduling pumpoff operations in onshore oilfields under electric-power constraints, A branch-and-price algorithm for stable workforce assignments with hierarchical skills, Origin and early evolution of corner polyhedra, Lower bounding procedure for the asymmetric quadratic traveling salesman problem, Bin packing and cutting stock problems: mathematical models and exact algorithms, Heuristic algorithms for visiting the customers in a rolling schedule environment, Arcs-states models for the vehicle routing problem with time windows and related problems, Hybrid column generation for large-size covering integer programs: application to transportation planning, A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems, Mathematical programming algorithms for bin packing problems with item fragmentation, A new formulation and approach for the black and white traveling salesman problem, One-dimensional cutting stock optimization in consecutive time periods, Supervised classification and mathematical optimization, Solution approaches for the cutting stock problem with setup cost, A constraint programming based column generation approach to nurse rostering problems, Determining the \(K\)-best solutions of knapsack problems, Bin packing and related problems: general arc-flow formulation with graph compression, Exactly solving packing problems with fragmentation, A branch-and-price algorithm for the capacitated facility location problem, A column generation approach to the heterogeneous fleet vehicle routing problem, The constrained compartmentalised knapsack problem, A matrix generation approach for eigenvalue optimization, In situ column generation for a cutting-stock problem, A branch-and-price algorithm to solve the molten iron allocation problem in iron and steel industry, New bin packing fast lower bounds, On the cutting stock problem under stochastic demand, A survey of dual-feasible and superadditive functions, Lower and upper bounds for the bin packing problem with fragile objects, The constrained compartmentalized knapsack problem: mathematical models and solution methods, A parallel algorithm for two-staged two-dimensional fixed-orientation cutting problems, Cutting stock with no three parts per pattern: work-in-process and pattern minimization, A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size, Reducing the number of cuts in generating three-staged cutting patterns, On the one-dimensional stock cutting problem in the paper tube industry, Trim loss optimization by an improved differential evolution, Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation, Characterization and modelling of guillotine constraints, Branch-and-price approach for the multi-skill project scheduling problem, A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects, Turning restriction design in traffic networks with a budget constraint, A coupling cutting stock-lot sizing problem in the paper industry, A new warmstarting strategy for the primal-dual column generation method, Large gaps in one-dimensional cutting stock problems, An improved approximation scheme for variable-sized bin packing, The proper relaxation and the proper gap of the skiving stock problem, \(N\)-fold integer programming, The double pivot simplex method, Numerical optimization method for packing regular convex polygons, Polylithic modeling and solution approaches using algebraic modeling systems, Efficient branch-and-bound algorithms for weighted MAX-2-SAT, 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, Production planning with approved vendor matrices for a hard-disk drive manufacturer, Semiconductor lot allocation using robust optimization, Optimal wafer cutting in shuttle layout problems, A short discussion of the OR crisis, A branch-and-price algorithm for placement routing for a multi-head beam-type component placement tool, Classification and literature review of integrated lot-sizing and cutting stock problems, Algorithms for the one-dimensional two-stage cutting stock problem, Stabilized branch-and-price algorithms for vector packing problems, 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, The shortest path problem with forbidden paths, 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 shortest path-based approach to the multileaf collimator sequencing problem, 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, An exact approach to extend network lifetime in a general class of wireless sensor networks, 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, Fixed charge problems with identical fixed charges, 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, Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem, On compact formulations for integer programs solved by column generation, An exact method for optimizing a quadratic function over the efficient set of multiobjective integer linear fractional program, A residual recombination heuristic for one-dimensional cutting stock problems, Stabilized column generation for the temporal knapsack problem using dual-optimal inequalities, Evaluation of different strategic planning approaches in a forest plantation in the North of Misiones Province, Argentina, Massive data classification via unconstrained support vector machines, Generating optimal T-shape cutting patterns for circular blanks, An introduction to stochastic bin packing-based server consolidation with conflicts, 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, A two-dimensional strip cutting problem with sequencing constraint, 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, Computing the nucleolus when the characteristic function is given implicitly: A constraint generation approach, Smart greedy procedure for solving a nonlinear knapsack class of reliability optimization problems, Computing equilibria for integer programming games, An exact algorithm for parallel machine scheduling with conflicts, Approximation and online algorithms for multidimensional bin packing: a survey, One-dimensional stock cutting: optimization of usable leftovers in consecutive orders, Pattern-based ILP models for the one-dimensional cutting stock problem with setup cost, Modularity maximization to design contiguous policy zones for pandemic response, Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost, Heuristics for the integer one-dimensional cutting stock problem: A computational study, Interactive procedures in large-scale two-dimensional cutting stock problems, On the nucleolus of the basic vehicle routing game, A branch-and-price algorithm for capacitated hypergraph vertex separation, Worst-case analysis of maximal dual feasible functions, A prototype column generation strategy for the multiple container loading problem, Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation, Bounds for the Nakamura number, A MIP model and a biased random-key genetic algorithm based approach for a two-dimensional cutting problem with defects, Large proper gaps in bin packing and dual bin packing problems, Conservative scales in packing problems, A simple \(OPT+1\) algorithm for cutting stock under the modified integer round-up property assumption, Dantzig-Wolfe decomposition and branch-and-price solving in G12, Build-pack planning for hard disk drive assembly with approved vendor matrices and stochastic demands, An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem, Analysis of three mathematical models of the staff rostering problem, Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows, Pattern minimisation in cutting stock problems, A note on ``Reducing the number of binary variables in cutting stock problems, Computational results with a primal-dual subproblem simplex method, A combined cutting-stock and lot-sizing problem, Bi-dynamic constraint aggregation and subproblem reduction, An enumeration scheme to generate constrained exact checkerboard patterns, 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, On the trade-off between staff-decomposed and activity-decomposed column generation for a staff scheduling problem, Solution methods for scheduling problems with sequence-dependent deterioration and maintenance events, An EPTAS for scheduling fork-join graphs with communication delay, Carathéodory bounds for integer cones, Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation, Solving a combined cutting-stock and lot-sizing problem with a column generating procedure, Comparative analysis of pattern-based models for the two-dimensional two-stage guillotine cutting stock problem, Two heuristics for the capacitated multi-period cutting stock problem with pattern setup cost, Lower bounds for three-dimensional multiple-bin-size bin packing problems, Simultaneously determining the mix of space launch vehicles and the assignment of satellites to rockets, An upper bound of \(\Delta(E) < 3 \slash 2\) for skiving stock instances of the divisible case, Characterizing the optimality gap and the optimal packings for the bin packing problem, Merging the local and global approaches to probabilistic satisfiability, Integrated design and operation of remnant inventory supply chains under uncertainty, Solving a class of stochastic mixed-integer programs with branch and price, 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, Solving bin packing problems using VRPSolver models, Price-and-verify: a new algorithm for recursive circle packing using Dantzig-Wolfe decomposition, Column generation based heuristic for learning classification trees, Decomposition methods for the lot-sizing and cutting-stock problems in paper industries, New bounds for truthful scheduling on two unrelated selfish machines, Modified greedy heuristic for the one-dimensional cutting stock problem, Branch-and-price for a class of nonconvex mixed-integer nonlinear programs, An algorithm for the computation of knapsack functions, New exact techniques applied to a class of network flow formulations, A bi-integrated model for coupling lot-sizing and cutting-stock problems, Dynamic-programming-based heuristic for multi-objective operating theater planning, L. V. Kantorovich and cutting-packing problems: new approaches for solving combinatorial problems of linear cutting and rectangular packing, The two-dimensional bin packing problem with variable bin sizes and costs, An linear programming based lower bound for the simple assembly line balancing problem, Generating optimal multi-segment cutting patterns for circular blanks in the manufacturing of electric motors, Improved flow-based formulations for the skiving stock problem, A proximal trust-region algorithm for column generation stabilization, Empowering the configuration-IP: new PTAS results for scheduling with setup times, Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem, Mathematical modeling and optimal blank generation in glass manufacturing, 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, Solving the selective multi-category parallel-servicing problem, Minimal proper non-IRUP instances of the one-dimensional cutting stock problem, Heuristic for the rectangular two-dimensional single stock size cutting stock problem with two-staged patterns, The one-dimensional cutting stock problem with usable leftovers -- a survey, A heuristic for scheduling in a two-stage hybrid flowshop with renewable resources shared among the stages, A combinatorial flow-based formulation for temporal bin packing problems, Supermajority politics: equilibrium range, policy diversity, utilitarian welfare, and political compromise, Resource time-sharing for IoT applications with deadlines, A reinforcement learning approach to the stochastic cutting stock problem, Nested \((2,3)\)-instances of the cutting stock problem, A one-dimensional puzzle to teach integer programming, An integer linear programming model for tilings, 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, Optimization of the cutting process integrated to the lot sizing in multi-plant paper production industries, A multistart biased‐randomized algorithm for solving a three‐dimensional case picking problem with real‐life constraints, A gradient search and column generation approach for the build–pack planning problem with approved vendor matrices and stochastic demand, A branch-and-price-and-cut algorithm for the pattern minimization problem, 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, Distributed Optimization in Networking: Recent Advances in Combinatorial and Robust Formulations, Tighter Bounds for the Gap and Non-IRUP Constructions in the One-dimensional Cutting Stock Problem, AN INTEGER L-SHAPED ALGORITHM FOR TIME-CONSTRAINED TRAVELING SALESMAN PROBLEM WITH STOCHASTIC TRAVEL AND SERVICE TIMES, Arc-flow model for the two-dimensional guillotine cutting stock problem, A heuristic for the one-dimensional cutting stock problem with usable leftover, Fuzzy fractional stochastic transportation problem involving exponential distribution, Ameso optimization: a relaxation of discrete midpoint convexity, Column generation algorithm for sensor coverage scheduling under bandwidth constraints, Combinatorial Benders' Cuts for the Strip Packing Problem, The Value of Randomized Solutions in Mixed-Integer Distributionally Robust Optimization Problems, An approach to two-dimensional cutting stock problems, Constructing an instance of the cutting stock problem of minimum size which does not possess the integer round-up property, Compact integer linear programming formulations for the temporal bin packing problem with fire-ups, Mathematical models and approximate solution approaches for the stochastic bin packing problem, Parameterized complexity of configuration integer programs, Exact and approximate methods for the score-constrained packing problem, On routing and scheduling a fleet of resource-constrained vessels to provide ongoing continuous patrol coverage, Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization, Minimizing setups and waste when printing labels of consumer goods, High-multiplicity \(N\)-fold IP via configuration LP, Modeling and solving the endpoint cutting problem, An introduction to the two‐dimensional rectangular cutting and packing problem, Fifty years of operational research in forestry, Heuristic algorithms based on column generation for an online product shipping problem, Exact approaches for the unconstrained two-dimensional cutting problem with defects, An integer linear optimization model to the compartmentalized knapsack problem, Fifty Years of OR in Forestry Preface to the Special Forestry Issue of INFOR, Incorporating Aggregate Diversity in Recommender Systems Using Scalable Optimization Approaches, Progressive Selection Method for the Coupled Lot-Sizing and Cutting-Stock Problem, Relaxation techniques applied to some loading problems, Exact solution of network flow models with strong relaxations, Chunking for massive nonlinear kernel classification, Cutting uncertain stock and vehicle routing in a sustainability forestry harvesting problem, Combining metaheuristics with mathematical programming, constraint programming and machine learning, Deriving compact extended formulations via LP-based separation techniques, From High-Level Model to Branch-and-Price Solution in G12, An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating, Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems, Solving Large Scale Optimization Problems in the Transportation Industry and Beyond Through Column Generation, The generalized assortment and best cutting stock length problems, Optimal job splitting on a multi-slot machine with applications in the printing industry, MIP Neighborhood Search Heuristics for a Capacitated Fixed-Charge Network Design Problem, O problema de corte de estoque em indústrias de móveis de pequeno e médio portes, Characterizing IRDP-instances of the skiving stock problem by means of polyhedral theory, Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines, Combining metaheuristics with mathematical programming, constraint programming and machine learning, A Heuristic Solution of a Cutting Problem Using Hypergraphs, Constraint programming-based column generation, Deriving compact extended formulations via LP-based separation techniques, The usable leftover one‐dimensional cutting stock problem—a priority‐in‐use heuristic, Sparse Solutions of Linear Diophantine Equations, Analysis and modelling of a production line in a corrugated box factory, Metodos Duales y algoritmos hibridos para problemas de «Set Partitioning», A dual algorithm for the one-machine scheduling problem, 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, Constraint programming-based column generation, The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization, An algorithm for determining the K-best solutions of the one-dimensional Knapsack problem, Renovation of the cutting stock process, Unnamed Item, An integer programming approach to the time slot assignment problem in SS/TDMA systems with intersatellite links, Exact algorithms for integrated facility location and production planning problems, Optimal design of a manpower system, Improving Cutting-Stock Plans with Multi-objective Genetic Algorithm, Massive data discrimination via linear support vector machines, Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation, A metaheuristic framework for nonlinear capacitated covering problems, One-dimensional cutting stock with a limited number of open stacks: bounds and solutions from a new integer linear programming model, Dual Inequalities for Stabilized Column Generation Revisited, Heurísticas para os problemas de geração e sequenciamento de padrões de corte bidimensionais, Integer programming approach to the printed circuit board grouping problem, Streaming algorithms for bin packing and vector scheduling, Sensitive Instances of the Cutting Stock Problem, A branch-price-and-cut algorithm for the min-maxk-vehicle windy rural postman problem, An EPTAS for scheduling on unrelated machines of few different types, Column-Generation in Integer Linear Programming, Better Bin Packing Approximations via Discrepancy Theory, A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems, Glass cutting in a small firm, Hybrid greedy heuristics based on linear programming for the three‐dimensional single bin‐size bin packing problem, A Constraint-Programming-Based Branch-and-Price-and-Cut Approach for Operating Room Planning and Scheduling, One-dimensional relaxations and LP bounds for orthogonal packing, A note on the primal-dual column generation method for combinatorial optimization, Cutting planes for branch-and-price algorithms, Unnamed Item, Soft OR and Practice: The Contribution of the Founders of Operations Research, Constrained Multiagent Markov Decision Processes: a Taxonomy of Problems and Algorithms, Unnamed Item, A column generation procedure for gang-rip saw arbor design and scheduling, Sequential design with applications to the trim-loss problem, Design of cellular manufacturing systems, Network design with grooming constraints, Adaptive Bin Packing with Overflow