Solving two-dimensional cutting stock problem via a DNA computing algorithm

DOI10.1007/s11047-020-09786-3zbMath1530.68087OpenAlexW3009637807MaRDI QIDQ6095483

S. A. MirHassani, M. Dodge, F. Hooshmand

Publication date: 8 September 2023

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-020-09786-3

zbMATH Keywords

DNA computingsticker modeltwo-dimensional cutting stock problemgarment and leather industries

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A novel text and image encryption method based on chaos theory and DNA computing
• A computational DNA solution approach for the quadratic Diophantine equation
• Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges
• Algorithms for nesting with defects
• Bun splitting: a practical cutting stock problem
• Solving the minimum bisection problem using a biologically inspired computational model
• Molecular solution to the 0-1 knapsack problem based on DNA computing
• Heuristic algorithm for a cutting stock problem in the steel bridge construction
• A polynomial-time DNA computing solution for the bin-packing problem
• DNA computing, sticker systems, and universality
• Efficient DNA sticker algorithms for NP-complete graph problems
• A clique covering MIP model for the irregular strip packing problem
• A beam search approach to solve the convex irregular bin packing problem with guillotine guts
• The cutting stock problem in the canvas industry
• Sticker DNA computer model. I: Theory
• A new DNA algorithm to solve graph coloring problem
• An Improved DNA-Sticker Addition Algorithm and Its Application to Logarithmic Arithmetic
• Glass cutting in a small firm
• Approximation Algorithms to Solve Real-Life Multicriteria Cutting Stock Problems

This page was built for publication: Solving two-dimensional cutting stock problem via a DNA computing algorithm