Knowledge-based systems for cutting stock problems
From MaRDI portal
Publication:1825760
DOI10.1016/0377-2217(90)90351-BzbMath0684.90075OpenAlexW2165425392MaRDI QIDQ1825760
Publication date: 1990
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(90)90351-b
Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Production models (90B30) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Artificial intelligence (68T99)
Related Items (2)
Cites Work
- An algorithm for the two-dimensional assortment problem
- Practical adaptations of the Gilmore-Gomory approach to cutting stock problems
- The trim-loss and assortment problems: A survey
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- An approach to two-dimensional cutting stock problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Knowledge-based systems for cutting stock problems