A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem (Q610985): Difference between revisions

Latest revision as of 14:07, 3 July 2024

scientific article

Language	Label	Description	Also known as
English	A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem	scientific article

Statements

instance of

scholarly article

0 references

title

A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem (English)

0 references

zbMATH Open document ID

1201.90174

0 references

DOI

10.1007/s10479-008-0457-4

0 references

0 references

0 references

Annals of Operations Research

0 references

publication date

13 December 2010

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

cutting and packing problems

0 references

constrained two-dimensional guillotine cutting patterns

0 references

dynamic programming

0 references

and/or-graph search

0 references

heuristics

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s10479-008-0457-4

0 references

0 references

0 references

A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems

0 references

Algorithms for Unconstrained Two-Dimensional Guillotine Cutting

0 references

A New Placement Heuristic for the Orthogonal Stock-Cutting Problem

0 references

An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts

0 references

State-space relaxation procedures for the computation of bounds to routing problems

0 references

An Algorithm for Two-Dimensional Cutting Problems

0 references

Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns

0 references

Packing problems

0 references

Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems

0 references

Q4398379

0 references

A typology of cutting and packing problems

0 references

An efficient approach for large-scale two-dimensional guillotine cutting stock problems

0 references

Lower bounds from state space relaxations for concave cost network flow problems

0 references

The Theory and Computation of Knapsack Functions

0 references

A new exact algorithm for the vehicle routing problem based on \(q\)-paths and \(k\)-shortest paths relaxations

0 references

An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock

0 references

The DH/KD algorithm: A hybrid approach for unconstrained two-dimensional cutting problems

0 references

Dynamic programming and hill-climbing techniques for constrained two-dimensional cutting stock problems

0 references

Two-dimensional packing problems: a survey

0 references

Q4321918

0 references

An AND/OR-graph approach to the container loading problem

0 references

Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach

0 references

An and-or-graph approach for two-dimensional cutting problems

0 references

An improved version of Wang's algorithm for two-dimensional cutting problems

0 references

Exact solutions for constrained two-dimensional cutting problems

0 references

Solution for the constrained Guillotine cutting problem by simulated annealing

0 references

A comparative numerical analysis for the guillotine two-dimensional cutting problem

0 references

Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography

0 references

Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems

0 references

An improved typology of cutting and packing problems

0 references

Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:610985

@@ Property / cites work @@
+A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
+Normal rank
@@ Property / cites work @@
+Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
+Normal rank
@@ Property / cites work @@
+A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
+Normal rank
@@ Property / cites work @@
+An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
+Normal rank
@@ Property / cites work @@
+State-space relaxation procedures for the computation of bounds to routing problems
+Normal rank
@@ Property / cites work @@
+An Algorithm for Two-Dimensional Cutting Problems
@@ Property / cites work: An Algorithm for Two-Dimensional Cutting Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns
+Normal rank
@@ Property / cites work @@
+Packing problems
@@ Property / cites work: Packing problems / rank @@
+Normal rank
@@ Property / cites work @@
+Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems
+Normal rank
@@ Property / cites work @@
+Q4398379
@@ Property / cites work: Q4398379 / rank @@
+Normal rank
@@ Property / cites work @@
+A typology of cutting and packing problems
@@ Property / cites work: A typology of cutting and packing problems / rank @@
+Normal rank
@@ Property / cites work @@
+An efficient approach for large-scale two-dimensional guillotine cutting stock problems
+Normal rank
@@ Property / cites work @@
+Lower bounds from state space relaxations for concave cost network flow problems
+Normal rank
@@ Property / cites work @@
+The Theory and Computation of Knapsack Functions
@@ Property / cites work: The Theory and Computation of Knapsack Functions / rank @@
+Normal rank
@@ Property / cites work @@
+A new exact algorithm for the vehicle routing problem based on \(q\)-paths and \(k\)-shortest paths relaxations
+Normal rank
@@ Property / cites work @@
+An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock
+Normal rank
@@ Property / cites work @@
+The DH/KD algorithm: A hybrid approach for unconstrained two-dimensional cutting problems
+Normal rank
@@ Property / cites work @@
+Dynamic programming and hill-climbing techniques for constrained two-dimensional cutting stock problems
+Normal rank
@@ Property / cites work @@
+Two-dimensional packing problems: a survey
@@ Property / cites work: Two-dimensional packing problems: a survey / rank @@
+Normal rank
@@ Property / cites work @@
+Q4321918
@@ Property / cites work: Q4321918 / rank @@
+Normal rank
@@ Property / cites work @@
+An AND/OR-graph approach to the container loading problem
+Normal rank
@@ Property / cites work @@
+Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach
+Normal rank
@@ Property / cites work @@
+An and-or-graph approach for two-dimensional cutting problems
+Normal rank
@@ Property / cites work @@
+An improved version of Wang's algorithm for two-dimensional cutting problems
+Normal rank
@@ Property / cites work @@
+Exact solutions for constrained two-dimensional cutting problems
+Normal rank
@@ Property / cites work @@
+Solution for the constrained Guillotine cutting problem by simulated annealing
+Normal rank
@@ Property / cites work @@
+A comparative numerical analysis for the guillotine two-dimensional cutting problem
+Normal rank
@@ Property / cites work @@
+Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
+Normal rank
@@ Property / cites work @@
+Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems
+Normal rank
@@ Property / cites work @@
+An improved typology of cutting and packing problems
+Normal rank
@@ Property / cites work @@
+Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
+Normal rank