Year-end Sale % OFF 
Abstract
In this paper, we propose a heuristic algorithm based on the Branch-and-Bound Method for solving a Stock Management Probrem. In this algorithm, we divide the problem into small ones and solve them repeatedly. This algorithm achieves considerable speedup over the exact Branch-and-Bound Method. However, we need more speedup to use this in practical situations. To this end, we improve the pruning strategy in the Branch-and-Bound Method. In particular, we define a relaxation problem that can easily be solved by Dynamic Programming and use its solution for pruning. As the result of this, we can get efficient approximate solution in practical time using standard PC.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
