Showing 1 - 10 of 456
A cutting stock problem is one of the main and classical problems in operations research that is modeled as LP problem. Because of its NP-hard nature, finding an optimal solution in reasonable time is extremely difficult and at least non-economical. In this paper, two meta-heuristic algorithms,...
Persistent link: https://www.econbiz.de/10009758828
Persistent link: https://www.econbiz.de/10011820837
Persistent link: https://www.econbiz.de/10011760853
Persistent link: https://www.econbiz.de/10011781025
Persistent link: https://www.econbiz.de/10011995253
Persistent link: https://www.econbiz.de/10013429492
Persistent link: https://www.econbiz.de/10010496490
Persistent link: https://www.econbiz.de/10011859440
Persistent link: https://www.econbiz.de/10011729395
Persistent link: https://www.econbiz.de/10009305974