A Linear Programming Approach to the Cutting-Stock Problem

Cited in

(only showing first 100 items - show all)

A 71/60 theorem for bin packing
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
Optimization of roll cutting in clothing industry
Crew pairing at Air France
Bi-dynamic constraint aggregation and subproblem reduction
A 3-level integrated lot sizing and cutting stock problem applied to a truck suspension factory
Supermajority politics: equilibrium range, policy diversity, utilitarian welfare, and political compromise
A tutorial on Branch-Price-and-Cut algorithms
Bin packing can be solved within 1+epsilon in linear time
A column generation approach to job grouping for flexible manufacturing systems
The constrained compartmentalised knapsack problem
Orbital shrinking: theory and applications
Exact approaches for the unconstrained two-dimensional cutting problem with defects
Evaluation of algorithms for one-dimensional cutting
An exact algorithm for parallel machine scheduling with conflicts
A note on the primal-dual column generation method for combinatorial optimization
Improved flow-based formulations for the skiving stock problem
A coupling cutting stock-lot sizing problem in the paper industry
Evaluation of different strategic planning approaches in a forest plantation in the North of Misiones Province, Argentina
Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths
An exact model for a slitting problem in the steel industry
Solution methods for scheduling problems with sequence-dependent deterioration and maintenance events
Mathematical models and decomposition methods for the multiple knapsack problem
High-multiplicity \(N\)-fold IP via configuration LP
Modeling and solving the endpoint cutting problem
The one-dimensional cutting stock problem with due dates
Cluster analysis and mathematical programming
A sequential heuristic procedure for one-dimensional cutting
Combining metaheuristics with mathematical programming, constraint programming and machine learning
The Value of Randomized Solutions in Mixed-Integer Distributionally Robust Optimization Problems
Optimal wafer cutting in shuttle layout problems
A short discussion of the OR crisis
Algorithms for the one-dimensional two-stage cutting stock problem
Classification and literature review of integrated lot-sizing and cutting stock problems
Stabilized branch-and-price algorithms for vector packing problems
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
Cutting aluminium coils with high length variabilities
A column generation approach to capacitated p-median problems
An approach to two-dimensional cutting stock problems
Carathéodory bounds for integer cones
Procedures for solving a 1-dimensional cutting problem
A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems
Application of optimization for solving a sawing stock problem with a cant sawing pattern
Adaptive Bin Packing with Overflow
DualBi: a dual bisection algorithm for non-convex problems with a scalar complicating constraint
Streaming algorithms for bin packing and vector scheduling
Solving a class of stochastic mixed-integer programs with branch and price
A hybrid approach for optimization of one-dimensional cutting
Nesting planning based on production priorities and technological efficiency
Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines
Reducing the number of cuts in generating three-staged cutting patterns
Decomposition methods for the lot-sizing and cutting-stock problems in paper industries
Composite stock cutting through simulated annealing
AN INTEGER L-SHAPED ALGORITHM FOR TIME-CONSTRAINED TRAVELING SALESMAN PROBLEM WITH STOCHASTIC TRAVEL AND SERVICE TIMES
Column generation algorithm for sensor coverage scheduling under bandwidth constraints
Improving competitiveness in veneers production by a simple-to-use DSS.
In situ column generation for a cutting-stock problem
Stochastic greedy algorithms for a temporal bin packing problem with placement groups
A branch-and-price algorithm for capacitated hypergraph vertex separation
A dual algorithm for the one-machine scheduling problem
An integrated approach to the one-dimensional cutting stock problem in coronary stent manufacturing
One-dimensional relaxations and LP bounds for orthogonal packing
Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation
A new model for complete solutions to one-dimensional cutting stock problems.
Long-term staffing based on qualification profiles
A survey of dual-feasible and superadditive functions
On the cutting stock problem under stochastic demand
A residual recombination heuristic for one-dimensional cutting stock problems
L. V. Kantorovich and cutting-packing problems: new approaches for solving combinatorial problems of linear cutting and rectangular packing
Polylithic modeling and solution approaches using algebraic modeling systems
Algorithms for the variable sized bin packing problem
Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem
Column generation based heuristic for learning classification trees
Recent advances on two-dimensional bin packing problems
Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems
Row and column generation technique for a multistage cutting stock problem
Fast neighborhood search heuristics for the colored bin packing problem
The integrated lot sizing and cutting stock problem with saw cycle constraints applied to furniture production
A branch and bound algorithm for the resource-constrained project scheduling problem
A generalized linear programming model for nurse scheduling
Selection of stockplate characteristics and cutting style for two dimensional cutting stock situations
The cutting stock problem applied to the hardening process in an automotive spring factory
Column-Generation in Integer Linear Programming
A sublinear-time approximation scheme for bin packing
Fifty years of operational research in forestry
An algorithm for the computation of knapsack functions
Solving the selective multi-category parallel-servicing problem
Capacity and assortment planning under one-way supplier-driven substitution for pharmacy kiosks with low drug demand
Scheduling pumpoff operations in onshore oilfields under electric-power constraints
A column generation procedure for gang-rip saw arbor design and scheduling
An algorithm for the 2D guillotine cutting stock problem
Approximation and online algorithms for multidimensional bin packing: a survey
Mathematical programming algorithms for bin packing problems with item fragmentation
Solution approaches for the cutting stock problem with setup cost
Smart greedy procedure for solving a nonlinear knapsack class of reliability optimization problems
One-dimensional cutting stock optimization in consecutive time periods
A branch-and-price algorithm for the capacitated facility location problem
The cutting stock problem in a hardboard industry: A case study.

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)