A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting

No abstract is available for this paper.

• Publication year

  2006

• Venue

  European Journal of Operational Research

• Publication date

  2006-05-16

• Fields of study

  Mathematics, Computer Science, Engineering

• Identifiers
  DOI 10.1016/j.ejor.2004.08.036
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Knapsack Problems

  2008cited by this paper
• Setup and Open-Stacks Minimization in One-Dimensional Stock Cutting

  2007cited by this paper
• One-dimensional cutting stock optimization in consecutive time periods

  2007cited by this paper
• A new model for complete solutions to one-dimensional cutting stock problems

  2004cited by this paper
• Strip generation algorithms for constrained two-dimensional two-staged cutting problems

  2004cited by this paper
• Optimal Integer Solutions to Industrial Cutting-Stock Problems: Part 2, Benchmark Results

  2003cited by this paper
• The Number of Setups ( Different Patterns ) in One-Dimensional Stock Cutting

  2003cited by this paper
• Integer linear programming models for 2-staged two-dimensional Knapsack problems

  2003influential reference
• Lift-and-project for Mixed 0-1 programming: recent progress

  2002cited by this paper
• Strengthening Chvátal-Gomory cuts and Gomory fractional cuts

  2002cited by this paper
• A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths

  2002cited by this paper
• LP models for bin packing and cutting stock problems

  2002cited by this paper
• Tighter Bounds for the Gap and Non-IRUP Constructions in the One-dimensional Cutting Stock Problem

  2002cited by this paper
• Exact Algorithms for Large-Scale Unconstrained Two and Three Staged Cutting Problems

  2001cited by this paper
• Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm

  2001influential reference
• Approximate and Exact Algorithms for Constrained (Un) Weighted Two-dimensional Two-staged Cutting Stock Problems

  2001cited by this paper
• Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem

  2000cited by this paper
• General Mixed Integer Programming: Computational Issues for Branch-and-Cut Algorithms

  2000cited by this paper
• Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems

  2000cited by this paper
• The ABACUS system for branch‐and‐cut‐and‐price algorithms in integer programming and combinatorial optimization

  2000cited by this paper
• A comparative numerical analysis for the guillotine two-dimensional cutting problem

  2000cited by this paper
• Tighter relaxations for the cutting stock problem

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

  1999cited by this paper
• bc–opt: a branch-and-cut code for mixed integer programs

  1999cited by this paper
• A Computational Study of Search Strategies for Mixed Integer Programming

  1999influential reference
• Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem

  1999cited by this paper
• Exact solution of cutting stock problems using column generation and branch-and-Bound

  1998cited by this paper
• Exact solution of cutting stock problems using column generation and branch-and-Bound 1 1 Paper pres

  1998cited by this paper
• ILOG OPTIMIZATION SUITE WHITE PAPER: DISCOVERING A COMPETITIVE ADVANTAGE

  1997cited by this paper
• A hybrid grouping genetic algorithm for bin packing

  1996cited by this paper
• Heuristics for the integer one-dimensional cutting stock problem: A computational study

  1996cited by this paper
• The modified integer round-up property of the one-dimensional cutting stock problem

  1995cited by this paper
• A BRANCH&BOUND ALGORITHM FOR SOLVING ONE-DIMENSIONAL CUTTING STOCK PROBLEMS EXACTLY

  1995cited by this paper
• A branch&bound algorithm for solving one-dimensional cutting stock problems exactly

  1995cited by this paper
• Solving binary cutting stock problems by column generation and branch-and-bound

  1994influential reference
• Linear Programming Cutting Problems

  1993cited by this paper
• Cutting and Packing in Production and Distribution

  1992cited by this paper
• A typology of cutting and packing problems

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

  1990cited by this paper
• A two-phase heuristic for strip packing: Algorithm and probabilistic analysis

  1987cited by this paper
• Algorithms for Unconstrained Two-Dimensional Guillotine Cutting

  1985cited by this paper
• Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems

  1983cited by this paper
• Solving Large-Scale Zero-One Linear Programming Problems

  1983cited by this paper
• Controlling Cutting Pattern Changes in One-Dimensional Trim Problems

  1975cited by this paper
• Integer Programming

  1972cited by this paper
• The Theory and Computation of Knapsack Functions

  1966cited by this paper
• Multistage Cutting Stock Problems of Two and More Dimensions

  1965cited by this paper
• A Linear Programming Approach to the Cutting Stock Problem---Part II

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

  1961influential reference

• Dynamic nested column and row generation for the Skiving Stock Problem under uncertain demand

  2025cites this paper
• Bin Packing with Thresholds: Mathematical Models and Theoretical Results

  2025cites this paper
• Solution of Bin Packing Instances in Falkenauer T Class: Not So Hard

  2025cites this paper
• Pseudo-Polynomial Formulations for the Bin Packing Problem with Minimum Color Fragmentation

  2025cites this paper
• DISSONÂNCIA COGNITIVA E TOMADA DE DECISÃO: UMA ANÁLISE TEÓRICA SOBRE RESISTÊNCIA À EVIDÊNCIA E MUDANÇA DE CRENÇAS EM CONTEXTOS ORGANIZACIONAIS

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

  2024cites this paper
• A Petri Net-Based Algorithm for Solving the One-Dimensional Cutting Stock Problem

  2024cites this paper
• A dedicated branch-price-and-cut algorithm for advance patient planning and surgeon scheduling

  2024cites this paper
• Theoretical analysis of integer programming models for the two-dimensional two-staged knapsack problem

  2024cites this paper
• A Branch-and-Cut-and-Price Algorithm for Cutting Stock and Related Problems

  2024influential citation
• Fast neighborhood search heuristics for the colored bin packing problem

  2023cites this paper
• Arc-flow formulations for the one-dimensional cutting stock problem with multiple manufacturing modes

  2023cites this paper
• Recovering Dantzig-Wolfe Bounds by Cutting Planes

  2023cites this paper
• Boosted Arc Flow Formulation Using Graph Compression for the Two-Dimensional Strip Cutting Problem

  2023cites this paper
• Lower and upper bounding procedures for the bin packing problem with concave loading cost

  2023cites this paper
• Robust Optimization for the Two-Dimensional Strip-Packing Problem with Variable-Sized Bins

  2023cites this paper
• Electric vehicle-based express service network design with recharging management: A branch-and-price approach

  2023cites this paper
• A Numerically Exact Algorithm for the Bin-Packing Problem

  2023cites this paper
• 5th generation district heating and cooling network planning: A Dantzig–Wolfe decomposition approach

  2023cites this paper
• Solving Cutting Stock Problems via an Extended Ryan-Foster Branching Scheme and Fast Column Generation

  2023cites this paper
• CROSS-CONTAMINATION: ACCELERATING LARGE LANGUAGE MODELS WITHOUT IMPACTING PERFORMANCE

  2022cites this paper
• Column generation extensions of set covering greedy heuristics

  2022cites this paper
• A graph neural network-based stock forecasting method utilizing multi-source heterogeneous data fusion

  2022cites this paper
• Predicting Stock Market Volatility from Candlestick Charts: A Multiple Attention Mechanism Graph Neural Network Approach

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

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

  2022cites this paper
• Contribution to Solving a Two-Dimensional Cutting Stock Problem with Two Objectives

  2022influential citation
• An introduction to stochastic bin packing-based server consolidation with conflicts

  2021cites this paper
• A residual recombination heuristic for one-dimensional cutting stock problems

  2021influential citation
• A Heuristic Approach for Two-Dimensional Rectangular Cutting Stock Problem considering Balance for Material Utilization and Cutting Complexity

  2021cites this paper
• Mathematical models and approximate solution approaches for the stochastic bin packing problem

  2021cites this paper
• A residual recombination heuristic for one-dimensional cutting stock problems

  2021cites this paper
• Packing: Towards 2x NLP BERT Acceleration

  2021cites this paper
• A capacitated multi pickup online food delivery problem with time windows: a branch-and-cut algorithm

  2021cites this paper
• Solving robust bin-packing problems with a branch-and-price approach

  2021cites this paper
• Solving Bin Packing Problems Using VRPSolver Models

  2021cites this paper
• Two-stage and one-group two-dimensional guillotine cutting problems with defects: a CP-based algorithm and ILP formulations

  2021cites this paper
• The Offline Virtual Network Function Packing Problem

  2021cites this paper
• Compact integer linear programming formulations for the temporal bin packing problem with fire-ups

  2021cites this paper
• On the Use of Equivalence Classes for Optimal and Suboptimal Bin Packing and Bin Covering

  2021cites this paper
• Integrating facility layout design and aisle structure in manufacturing systems: Formulation and exact solution

  2021cites this paper
• An effective heuristic based on column generation for the two-dimensional three-stage steel plate cutting problem

  2020influential citation
• Exact solution techniques for two-dimensional cutting and packing

  2020influential citation
• An effective heuristic based on column generation for the two-dimensional three-stage steel plate cutting problem

  2020cites this paper
• A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems

  2020cites this paper
• A branch-and-price algorithm for the two-dimensional vector packing problem

  2020cites this paper
• Heuristic Search for a Real-World 3D Stock Cutting Problem

  2020cites this paper
• Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems

  2020cites this paper
• A Branch-and-Price-and-Cut Algorithm for the Cable-Routing Problem in Solar Power Plants

  2020cites this paper
• Exact and Heuristic Approaches to Batching-and-scheduling for the Composites Manufacturing Problem

  2020cites this paper
• A Geometrical Branch-and-Price (GEOM-BP) Algorithm for Big Bin Packing Problems.

  2019influential citation
• A lexicographic pricer for the fractional bin packing problem

  2019cites this paper
• Models for the two-dimensional level strip packing problem – a review and a computational evaluation

  2019cites this paper
• A Stochastic Bin Packing Approach for Server Consolidation with Conflicts

  2019cites this paper
• A generic exact solver for vehicle routing and related problems

  2019cites this paper
• A GRAVITATIONAL SEARCH ALGORITHM FOR ONE-DIMENSIONAL CUTTING STOCK PROBLEM

  2019influential citation
• Models for the two-dimensional rectangular single large placement problem with guillotine cuts and constrained pattern

  2019cites this paper
• A Genetic Algorithm Approach for the Multiple Length Cutting Stock Problem

  2019cites this paper
• The Effect of Welding on the One-Dimensional Cutting-Stock Problem: The Case of Fixed Firefighting Systems in the Construction Industry

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

  2018cites this paper
• Optimal Multi-Way Number Partitioning

  2018cites this paper
• Contributions to the two-dimensional guillotine cutting stock problem

  2018cites this paper
• The sharpest column : stabilizing column generation for the bin packing problem via a lexicographic pricer

  2018cites this paper
• Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation

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

  2018cites this paper
• A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems

  2018influential citation
• Optimal design of decentralized energy conversion systems for smart microgrids using decomposition methods

  2018influential citation
• Implementation of pattern generation algorithm in forming Gilmore and Gomory model for two dimensional cutting stock problem

  2018cites this paper
• One-Dimensional Cutting Stock

  2018cites this paper
• Permutation Problems, Genetic Algorithms, and Dynamic Representations

  2017cites this paper
• An Evolutionary Stochastic-Local-Search Framework for One-Dimensional Cutting-Stock Problems

  2017cites this paper
• A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function

  2017cites this paper
• New model and heuristic solution approach for one-dimensional cutting stock problem with usable leftovers

  2017cites this paper
• Optimal Stock Sizing in a Cutting Stock Problem with Stochastic Demands

  2017cites this paper
• A Graph Theoretic Approach for Minimizing Storage Space using Bin Packing Heuristics

  2017cites this paper
• The unbounded knapsack problem : a critical review

  2017cites this paper
• Mathematical models and decomposition algorithms for cutting and packing problems

  2017influential citation
• Branch and Price and Cut for the Split-Delivery Vehicle Routing Problem with Time Windows and Linear Weight-Related Cost

  2017cites this paper
• Cutting & Packing Problems: General Arc-flow Formulation with Graph Compression

  2017cites this paper
• BPPLIB: a library for bin packing and cutting stock problems

  2017cites this paper
• Effective Mathematical Simulation for One-Dimensional Cutting Stock Problem using Heuristics Approach

  2017cites this paper
• UKP5: A New Algorithm for the Unbounded Knapsack Problem

  2016cites this paper
• The Skiving Stock Problem and its Application to Cognitive Radio Networks

  2016cites this paper
• Bin packing and cutting stock problems: Mathematical models and exact algorithms

  2016influential citation
• Discrete Optimization A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function

  2016cites this paper
• An exact approach based on a new pseudo-polynomial network flow model for integrated planning and scheduling

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

  2016influential citation
• Integer linear programming models for the skiving stock problem

  2016cites this paper
• Two-stage two-dimensional guillotine cutting stock problems with usable leftover

  2016cites this paper
• One-dimensional Cutting Stock Problem with Divisible Items

  2016cites this paper
• Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing

  2016cites this paper
• A Branch-and-Price Algorithm for Bin Packing Problem

  2015cites this paper
• Cut and Column Generation

  2015cites this paper
• Análisis computacional de los problemas del vendedor viajero y patrones de corte A Computational Analysis of the Traveling Salesman and Cutting Stock Problems

  2015cites this paper
• Decentralized scheduling strategy of heating systems for balancing the residual load

  2015cites this paper
• Análisis computacional de los problemas del vendedor viajero y patrones de corte

  2015cites this paper
• Separation of Generic Cutting Planes in Branch-and-Price Using a Basis

  2015cites this paper
• Um Simulated Annealing no Problema do Corte Unidimensional Inteiro

  2015cites this paper
• Solving large-scale fixed cost integer linear programming models for grid-based location problems with heuristic techniques

  2015cites this paper
• Efficient local search for several combinatorial optimization problems. (Recherche locale performante pour la résolution de plusieurs problèmes combinatoires)

  2015cites this paper