Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem

No abstract is available for this paper.

• Publication year

  2000

• Venue

  Operational Research

• Publication date

  2000-11-15

• Fields of study

  Mathematics, Computer Science, Engineering

• Identifiers
  DOI 10.1287/opre.48.6.915.12391
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm

  2000cited by this paper
• Pattern Minimisation in Cutting Stock Problems

  1999cited by this paper
• On the separation of maximally violated mod-k cuts

  1999cited by this paper
• Computational study of a column generation algorithm for bin packing and cutting stock problems

  1999cited by this paper
• Branch-and-Price Algorithms for the One-Dimensional Cutting Stock Problem

  1998cited by this paper
• Branch-and-Price: Column Generation for Solving Huge Integer Programs

  1998cited by this paper
• Embedding of linear programming in a simulated annealing algorithm for solving a mixed integer production planning problem

  1995cited by this paper
• An exact algorithm for IP column generation

  1994cited by this paper
• Optimal solutions for the cutting stock problem

  1990cited by this paper
• Knapsack Problems: Algorithms and Computer Implementations

  1990cited by this paper
• A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems

  1990cited by this paper
• Integer and Combinatorial Optimization

  1988cited by this paper
• The cutting stock problem and integer rounding

  1985cited by this paper
• The NP-Completeness Column: An Ongoing Guide

  1982cited by this paper
• Johnson: computers and intractability: a guide to the theory of np- completeness (freeman

  1979cited by this paper
• A Linear Programming Approach to the Cutting-Stock Problem

  1961cited by this paper

• Two-dimensional cutting stock problem with flexible length and usable leftovers in the steel industry

  2025cites this paper
• A local branching-based solution for the multi-period cutting stock problem with tardiness, earliness, and setup costs

  2025cites this paper
• Integrated cutting stock and multi-period inventory optimization considering raw material–product eligibility for steel-pipe manufacturers

  2025cites this paper
• Random-Key Optimizer with reinforcement learning for the Capacitated Multi-period Cutting Stock Problem with setup cost

  2025cites this paper
• OPTICUT: a new heuristic algorithm for the one-dimensional cutting stock problem with pattern minimization

  2025cites this paper
• A bay design problem in less-than-unit-load production warehouse

  2024cites this paper
• Increasing productivity by generating optimal cutting patterns in the rolling mill of Shahid Bahonar Copper Industries Corporation

  2024cites this paper
• Minimizing saw cycles on the cutting stock problem with processing times depending on the cutting pattern

  2023cites this paper
• Minimizing rebar cost using design and construction integration

  2023cites this paper
• Setup improvement review and trend

  2023cites this paper
• Pattern-based ILP models for the one-dimensional cutting stock problem with setup cost

  2022influential citation
• Pattern-based ILP models for the one-dimensional cutting stock problem with setup cost

  2022cites this paper
• Mathematical models for the two-dimensional variable-sized cutting stock problem in the home textile industry

  2022cites this paper
• A BI-OBJECTIVE MULTIPERIOD ONE-DIMENSIONAL CUTTING STOCK PROBLEM

  2022cites this paper
• Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost

  2022cites this paper
• Scheduling of semi-automatic carousels with fixed production sequences

  2022cites this paper
• Hybrid heuristic for the production replanning problem under varying demands in manufacturing industries

  2021cites this paper
• Can ML predict the solution value for a difficult combinatorial problem?

  2020cites this paper
• Counterexamples in the CSP

  2020cites this paper
• Counterexamples in the Cutting Stock Problem

  2020cites this paper
• Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation

  2020cites this paper
• On the facet defining inequalities of the mixed-integer bilinear covering set

  2020cites this paper
• About tooling capacity for the vulcanising planning decision problem to improve strategic business profit

  2020cites this paper
• Dynamic-programming-based heuristic for multi-objective operating theater planning

  2020influential citation
• Dual-feasible functions for integer programming and combinatorial optimization: Algorithms, characterizations, and approximations

  2019cites this paper
• Simulated Annealing algorithm and implementation software for fabric cutting problem

  2019cites this paper
• An Innovative Genetic Algorithm for a Multi-Objective Optimization of Two-Dimensional Cutting-Stock Problem

  2019cites this paper
• Progressive Selection Method for the Coupled Lot-Sizing and Cutting-Stock Problem

  2019cites this paper
• Two heuristics for the capacitated multi-period cutting stock problem with pattern setup cost

  2019cites this paper
• Facets of a mixed-integer bilinear covering set with bounds on variables

  2019cites this paper
• Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria

  2018cites this paper
• Characterization and Approximation of Strong General Dual Feasible Functions

  2018cites this paper
• Combined cutting stock and lot-sizing problem with pattern setup

  2018cites this paper
• Classification and literature review of integrated lot-sizing and cutting stock problems

  2018cites this paper
• Balanced approach for the two-dimensional rectangular guillotine cutting stock problem with setup cost

  2018cites this paper
• The robust machine availability problem – bin packing under uncertainty

  2018cites this paper
• Structure and Interpretation of Dual-Feasible Functions

  2017cites this paper
• Facets of a mixed-integer bilinear covering set with bounds on variables

  2017cites this paper
• A heuristic approach to minimize the number of saw cycles in small-scale furniture factories

  2017cites this paper
• A vulcanising decision planning as a particular one-dimensional cutting stock problem with limited part-related tooling in make-to-order industrial environments

  2017cites this paper
• Progressive Selection Method for the Coupled Lot-Sizing and Cutting-Stock Problem

  2017cites this paper
• NONLINEAR CUTTING STOCK PROBLEM

  2016cites this paper
• Mathematical models and a heuristic method for the multiperiod one-dimensional cutting stock problem

  2016cites this paper
• Classical Dual-Feasible Functions

  2016cites this paper
• Comparison of two metaheuristics to solve a 2-D cutting stock problem with set-up cost in the paper industry

  2016cites this paper
• Applications for Cutting and Packing Problems

  2016cites this paper
• Other Applications in General Integer Programming

  2016cites this paper
• General Dual-Feasible Functions

  2016cites this paper
• An algorithm for a cutting problem in window frame production

  2016cites this paper
• Linear and Integer Programming

  2016cites this paper
• Reformulation and Algorithms for Combinatorial Optimization

  2016cites this paper
• MODELOS MATEMÁTICOS PARA O PROBLEMA INTEGRADO DE DIMENSIONAMENTO DE LOTES E CORTE DE ESTOQUE UNIDIMENSIONAL

  2015cites this paper
• Pattern-set generation algorithm for the one-dimensional cutting stock problem with setup cost

  2015cites this paper
• A branch-price-and-cut method for the vegetable crop rotation scheduling problem with minimal plot sizes

  2015cites this paper
• A Genetic Algorithm to Solve a Real 2-D Cutting Stock Problem with Setup Cost in the Paper Industry

  2015cites this paper
• Using dual feasible functions to construct fast lower bounds for routing and location problems

  2015cites this paper
• On cutting stock with due dates

  2014cites this paper
• A genetic algorithm for the one-dimensional cutting stock problem with setups

  2014cites this paper
• Solving real-world cutting stock-problems in the paper industry: Mathematical approaches, experience and challenges

  2014influential citation
• Column generation and sequential heuristic procedure for solving an irregular shape cutting stock problem

  2014cites this paper
• Finding Pattern Configurations for Bank Cheque Printing

  2014cites this paper
• UM PROBLEMA DE CORTE DE ESTOQUE MULTIOBJETIVO

  2014cites this paper
• Approaches to real world two-dimensional cutting problems

  2014cites this paper
• Solution approaches for the cutting stock problem with setup cost

  2013influential citation
• Project-Team REALOPT Reformulations based algorithms for Combinatorial Optimization

  2013cites this paper
• Using the primal-dual interior point algorithm within the branch-price-and-cut method

  2013cites this paper
• Sequential grouping heuristic for the two-dimensional cutting stock problem with pattern reduction

  2013cites this paper
• EXTENSIONS OF CUTTING PROBLEMS: SETUPS*

  2013influential citation
• Aplicação de técnicas de decomposição em problemas de corte de estoque

  2013cites this paper
• Theoretical and computational issues for improving the performance of linear optimization methods

  2013cites this paper
• Generation and Sequential Heuristic Procedure for solving an Irregular Shape Cutting Stock Problem

  2013cites this paper
• Worst-case analysis of maximal dual feasible functions

  2012cites this paper
• Joint optimization of successive manufacturing processes and cycle service levels in the paper supply chain

  2012cites this paper
• On the extremality of maximal dual feasible functions

  2012cites this paper
• A CAM system for one-dimensional stock cutting

  2012cites this paper
• A Column-Generation Based Tactical Planning Method for Inventory Routing

  2012cites this paper
• C-Sets-based sequential heuristic procedure for the one-dimensional cutting stock problem with pattern reduction

  2011cites this paper
• Branching in branch-and-price: a generic scheme

  2011cites this paper
• On LP relaxations for the pattern minimization problem

  2011influential citation
• Computing maximal dual-feasible functions using a novel approach

  2011cites this paper
• A hybrid approach based on genetic algorithms to solve the problem of cutting structural beams in a metalwork company

  2011cites this paper
• General properties of staircase and convex dual feasible functions

  2011cites this paper
• Cutting stock with no three parts per pattern: Work-in-process and pattern minimization

  2011influential citation
• One-Dimensional Cutting Stock Optimization with Usable Leftover: A Case of Low Stock-to-Order Ratio

  2011cites this paper
• Project-Team realopt Reformulations based algorithms for Combinatorial Optimization

  2011cites this paper
• An evolutionary algorithm for the one-dimensional cutting stock problem

  2011cites this paper
• Strips minimization in two-dimensional cutting stock of circular items

  2010cites this paper
• A survey of dual-feasible and superadditive functions

  2010influential citation
• Optimal job splitting on a multi‐slot machine with applications in the printing industry

  2010cites this paper
• Theoretical investigations on maximal dual feasible functions

  2010cites this paper
• Project-Team RealOpt Reformulation based algorithms for Combinatorial Optimization

  2010cites this paper
• Mathematical Model for Waste Reduction in Aluminum Fabrication Industry in Kuwait

  2010cites this paper
• A Nonlinear Cutting Stock Problem

  2010influential citation
• An integrated approach to the one-dimensional cutting stock problem in coronary stent manufacturing

  2009cites this paper
• The One-Dimensional Cutting Stock Problem The Standard Cutting

  2009influential citation
• A pattern reduction procedure in a one-dimensional cutting stock problem by grouping items according to their demands

  2009cites this paper
• An effective solution for a real cutting stock problem in manufacturing plastic rolls

  2009influential citation
• Cutting as a continuous business process

  2009cites this paper
• New lower bounds based on column generation and constraint programming for the pattern minimization problem

  2009influential citation
• Uma heurística baseada em geração sequencial de padrões para o problema de corte de estoque unidimensional com um número reduzido de padrões

  2009cites this paper