Author:
Kamarainen Olli,Sakkout Hani El
Publisher
Springer Berlin Heidelberg
Reference28 articles.
1. F. Ajili and H. El Sakkout. LP probing for piecewise linear optimization in scheduling. In Proc. of CP-AI-OR’01, pages 189–203, 2001.
2. N. Barnier and P. Brisset. Combine & conquer: Genetic algorithm and CP for optimization. In Proc. of CP98, page 436, 1998.
3. C. Beck and P. Refalo. A hybrid approach to scheduling with earliness and tardiness costs. In Proc. of CP-AI-OR’01, pages 175–188, 2001.
4. Y. Caseau and F. Laburthe. Heuristics for large constrained vehicle routing problems. Journal of Heuristics, 5(3):281–303, 1999.
5. A. Cesta, A. Oddi, and S. Smith. A constraint-based method for project scheduling with time windows. Journal of Heuristics, 8(1):109–136, 2002.
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献