A Linear Programming Approach to the Cutting-Stock Problem

Cited in

(only showing first 100 items - show all)

A metaheuristic framework for nonlinear capacitated covering problems
Improving Cutting-Stock Plans with Multi-objective Genetic Algorithm
Greedy algorithms for the temporal bin packing problem with failure domain
Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model
Combining metaheuristics with mathematical programming, constraint programming and machine learning
The tolerance approach in multiobjective linear fractional programming
An analysis of the integrated lot-sizing and cutting-stock problem formulation
A mathheuristic approach for the vehicle routing problem with queuing considerations
Compact integer linear programming formulations for the temporal bin packing problem with fire-ups
On the problem of multiple mobile robots cluttering a workspace
An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating
Efficient algorithms for real-life instances of the variable size bin packing problem
An linear programming based lower bound for the simple assembly line balancing problem
Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem
Selection of parts and machines for cellularization: A mathematical programming approach
Solving bin packing problems using VRPSolver models
Sequential design with applications to the trim-loss problem
Network design with grooming constraints
Build-pack planning for hard disk drive assembly with approved vendor matrices and stochastic demands
The double pivot simplex method
Linear fractional approximations for master problems in column generation
Massive data classification via unconstrained support vector machines
Large-scale optimization with the primal-dual column generation method
An exact method for optimizing a quadratic function over the efficient set of multiobjective integer linear fractional program
Efficient branch-and-bound algorithms for weighted MAX-2-SAT
A column generation approach and new bounds for the car sequencing problem
Renovation of the cutting stock process
Column generation applied to linear programs in course registration
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
Supervised classification and mathematical optimization
Better bin packing approximations via discrepancy theory
Cutting planes for branch-and-price algorithms
A one-dimensional puzzle to teach integer programming
An integer linear programming model for tilings
Lower and upper bounds for the bin packing problem with fragile objects
Algorithms for the item assortment problem: an application to vending machine products
Families of non-IRUP instances of the one-dimensional cutting stock problem
A proximal trust-region algorithm for column generation stabilization
An exact algorithm for IP column generation
Price-and-branch heuristic for vector bin packing
Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case
Chunking for massive nonlinear kernel classification
Practical methods for shape fitting and kinetic data structures using coresets
Worst-case analysis of maximal dual feasible functions
The value of integrating loading and routing
Conservative scales in packing problems
Arc-flow model for the two-dimensional guillotine cutting stock problem
A new warmstarting strategy for the primal-dual column generation method
Scheduling kernels via configuration LP
A heuristic for scheduling in a two-stage hybrid flowshop with renewable resources shared among the stages
One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming
An introduction to the two‐dimensional rectangular cutting and packing problem
Mathematical models and a heuristic method for the multiperiod one-dimensional cutting stock problem
An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem
An EPTAS for scheduling fork-join graphs with communication delay
An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems
Stock cutting to minimize cutting length
A note on ``Reducing the number of binary variables in cutting stock problems
A matrix generation approach for eigenvalue optimization
A branch-and-price algorithm to solve the molten iron allocation problem in iron and steel industry
Large proper gaps in bin packing and dual bin packing problems
An empirical analysis of exact algorithms for the unbounded knapsack problem
Arc-flow formulation and branch-and-price-and-cut algorithm for the bin-packing problem with fragile objects
A bay design problem in less-than-unit-load production warehouse
The generalized assortment and best cutting stock length problems
Mathematical and computational model for the efficient solution of two-dimensional (2D) material cutting problems using integer linear programming
Last fifty years of integer linear programming: a focus on recent practical advances
The usable leftover one-dimensional cutting stock problem -- a priority-in-use heuristic
Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation
Solving the parallel processor scheduling and bin packing problems with contiguity constraints: mathematical models and computational studies
One-dimensional bin packing with pattern-dependent processing time
Semiconductor lot allocation using robust optimization
Optimising the cutting of wood fibre plates in the hardboard industry
Integer optimization models and algorithms for the multi-period non-shareable resource allocation problem
Mathematical optimisation in the honeycomb cardboard industry: a model for the two-dimensional variable-sized cutting stock problem
The two-dimensional cutting stock problem within the roller blind production process
Production planning with approved vendor matrices for a hard-disk drive manufacturer
Practical adaptations of the Gilmore-Gomory approach to cutting stock problems
Roll cutting in the curtain industry, or: a well-solvable allocation problem
Complexity of scheduling few types of jobs on related and unrelated machines
A gradient search and column generation approach for the build–pack planning problem with approved vendor matrices and stochastic demand
An upper bound of \(\Delta(E) < 3 \slash 2\) for skiving stock instances of the divisible case
Integer programming approach to the printed circuit board grouping problem
Generating optimal multi-segment cutting patterns for circular blanks in the manufacturing of electric motors
Alternative configurations for cutting machines in a tube cutting mill
Analysis of three mathematical models of the staff rostering problem
Computational results with a primal-dual subproblem simplex method
An integer programming approach to the time slot assignment problem in SS/TDMA systems with intersatellite links
A note on the approximability of cutting stock problems
A branch-and-price-and-cut algorithm for the pattern minimization problem
Dual inequalities for stabilized column generation revisited
\(N\)-fold integer programming
The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
Mathematical models for the one-dimensional cutting stock problem with setups and open stacks
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
Integrating process optimization and inventory planning in cutting-stock with skiving option: an optimization model and its application
A column generation method for the multiple-choice multi-dimensional knapsack problem

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)