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

From MaRDI portal

Jump to:navigation, search

WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Dynamic_programming_and_hill-climbing_techniques_for_constrained_two-dimensional_cutting_stock_problems&oldid=72914931"