A tabu search algorithm for a two-dimensional non-guillotine cutting problem
From MaRDI portal
Recommendations
- A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
- A local search approach for two-dimensional irregular cutting
- An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
- A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems
- scientific article; zbMATH DE number 1488076
Cites work
- A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems
- A population heuristic for constrained two-dimensional non-guillotine cutting
- An Algorithm for Two-Dimensional Cutting Problems
- An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems
- An effective quasi-human based heuristic for solving the rectangle packing problem
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- An exact algorithm for general, orthogonal, two-dimensional knapsack problems
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- An optimal algorithm for rectangle placement
- Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- Modeling of packing problems
- On genetic algorithms for the packing of polygons
- On the two-dimensional knapsack problem
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
Cited in
(31)- A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting
- New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
- A tabu search algorithm for the bipartite drawing problem
- A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem
- An efficient deterministic heuristic for two-dimensional rectangular packing
- Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows
- A hybrid algorithm for the non-Guillotine cutting problem
- A local search approach for two-dimensional irregular cutting
- A multi-objective genetic algorithm for a special type of 2D orthogonal packing problems
- Exact solution techniques for two-dimensional cutting and packing
- The maximum diversity assortment selection problem
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- A MIP model and a biased random-key genetic algorithm based approach for a two-dimensional cutting problem with defects
- Using a tabu search approach for solving the two-dimensional irregular cutting problem
- A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
- Tabu search for two-dimensional irregular cutting,
- SLOPPGEN: a problem generator for the two-dimensional rectangular single large object placement problem with defects
- A hybrid evolutionary algorithm for the two-dimensional packing problem
- A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces
- Optimization of a line-cutting procedure for ship hull construction by an effective tabu search
- scientific article; zbMATH DE number 1488076 (Why is no real title available?)
- A tabu thresholding implementation for the irregular stock cutting problem
- An exact rectangular two-segment layout algorithm with optimal same-shape strip generation
- Computational Science - ICCS 2004
- A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
- An introduction to the two‐dimensional rectangular cutting and packing problem
- Maximizing revenue with allocation of multiple advertisements on a Web banner
- Revenue maximization for multiple advertisements placement on a web banner using a pixel-price model
- A polynomial mixed-integer linear programming model for two-dimensional guillotine strip packing problem
- Filtered beam search algorithm for the two-dimensional rectangular packing problem
- A least wasted first heuristic algorithm for the rectangular packing problem
This page was built for publication: A tabu search algorithm for a two-dimensional non-guillotine cutting problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2643950)
