Author:
Chu Geoffrey,Stuckey Peter J.
Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. Becceneri, J.C., Yannasse, H.H., Soma, N.Y.: A method for solving the minimization of the maximum number of open stacks problem within a cutting process. Computers & Operations Research 31, 2315–2332 (2004)
2. Garcia de la Banda, M., Stuckey, P.J.: Dynamic programming to minimize the maximum number of open stacks. INFORMS JOC 19(4), 607–617 (2007)
3. Linhares, A., Yanasse, H.H.: Connections between cutting-pattern sequencing, VLSI design, and flexible machines. Computers & Operations Research 29, 1759–1772 (2002)
4. Prestwich, S.: Increasing solution density by dominated relaxation. In: 4th Int. Workshop on Modelling and Reformulating Constraint Satisfaction Problems (2005)
5. Shaw, P., Laborie, P.: A constraint programming approach to the min-stack problem. Constraint Modelling Challenge 2005 [6]
Cited by
23 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献