Logic based Benders' decomposition for orthogonal stock cutting problems
type: Item
instance of: scholarly article
title: Logic based Benders' decomposition for orthogonal stock cutting problems
zbMATH Open document ID: 1391.90514
author: Maxence Delorme
author: Manuel Iori
author: Silvano Martello
published in: Computers \& Operations Research
publication date: 2018-07-11T00:00:00Z
full work available at URL: http://hdl.handle.net/11585/588348
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90B80
zbMATH DE Number: 6901300
zbMATH Keywords: orthogonal stock cutting problem
zbMATH Keywords: logic based Benders' decomposition
zbMATH Keywords: rectangle packing
zbMATH Keywords: pallet loading
MaRDI profile type: Publication
OpenAlex ID: W2519499514
cites work: An exact approach to the strip-packing problem
cites work: Two-dimensional packing problems: a survey
cites work: Bin packing and cutting stock problems: mathematical models and exact algorithms
cites work: Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
cites work: An improved typology of cutting and packing problems
cites work: Exhaustive approaches to 2D rectangular perfect packings
cites work: A branch and bound algorithm for the strip packing problem
cites work: An Exact Algorithm for the Two-Dimensional Strip-Packing Problem
cites work: Scheduling inspired models for two-dimensional packing problems
cites work: Combinatorial Benders' Cuts for the Strip Packing Problem
cites work: On genetic algorithms for the packing of polygons
cites work: Q4452972
cites work: A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
cites work: A skyline heuristic for the 2D rectangular packing and strip packing problems
cites work: Exact algorithms for the two-dimensional strip packing problem with and without rotations
cites work: An exact strip packing algorithm based on canonical forms
cites work: Worst-case analysis of fast heuristics for packing squares into a square
cites work: Packing into the smallest square: worst-case analysis of lower bounds
cites work: Resource augmentation in two-dimensional packing with orthogonal rotations
cites work: Models and algorithms for packing rectangles into the smallest square
cites work: An exact algorithm for the pallet loading problem
cites work: A branch-and-cut algorithm for the pallet loading problem
cites work: An L-approach for packing (ℓ, w)-rectangles into rectangular and L-shaped pieces
cites work: An effective recursive partitioning approach for the packing of identical rectangles in a rectangle
cites work: The pallet loading problem: a review of solution methods and computational experiments
cites work: Q4523706
cites work: Logic-based Benders decomposition
cites work: Planning and Scheduling by Logic-Based Benders Decomposition
cites work: Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
cites work: A new constraint programming approach for the orthogonal packing problem
cites work: A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
cites work: Partitioning procedures for solving mixed-variables programming problems
cites work: Exact solution of bin-packing problems using column generation and branch-and-bound
cites work: Q4475618
cites work: An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
cites work: An Algorithm for Two-Dimensional Cutting Problems
cites work: Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
cites work: An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
cites work: Two-Dimensional Finite Bin-Packing Algorithms
cites work: Exact solution of the two-dimensional finite bin packing problem
cites work: Optimal rectangle packing
cites work: A tabu search algorithm for the pallet loading problem
DOI: 10.1016/J.COR.2016.09.009
description: scientific article; zbMATH DE number 6901300