Author:
Bockmayr Alexander,Pisaruk Nicolai,Aggoun Abderrahmane
Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. A. Aggoun and N. Beldiceanu. Extending CHIP in order to solve complex scheduling and placement problems. Mathl. Comput. Modelling, 17(7):57–73, 1993.
2. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network flows: theory, algorithms and applications. Prentice Hall, 1993.
3. R. K. Ahuja, J. B. Orlin, G. M. Sechi, and P. Zuddas. Algorithms for the simple equal flow problem. Management Science, 45(10):1440–1455, 1999.
4. Lect Notes Comput Sci;N. Beldiceanu,2000
5. N. Beldiceanu and E. Contejean. Introducing global constraints in CHIP. Mathl. Comput. Modelling, 20(12):97–123, 1994.
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献