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,...

Written by an experienced operations research practitioner with a strong applied mathematics background, this book offers practical insights into how to approach optimization problems, how to develop intelligent and efficient mathematical models and algorithms, and how to implement and deliver...