Branch-and-Cut 알고리즘에서 Lot-Sizing 문제에 대한 Cutting Planes의 전산 성능 연구

초록

In this paper, we evaluate the strength of three families of cutting planes for a lot-sizing problem. Lot-sizing problem is very basic MIP model for production planning and many strong valid inequalities have been developed for a variety of relaxations in the literature. To use three families of cutting planes in Branch-and-Cut framework, we develop separation algorithms for each cut and implement them in CPLEX. Then, we perform computational study to compare the effectiveness of three cuts for randomly generated instances of the lot-sizing problem.

키워드