Author:
Quimper Claude-Guy,Golynski Alexander,López-Ortiz Alejandro,Van Beek Peter
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Software
Reference20 articles.
1. Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1993). Network Flows: Theory, Algorithms, and Applications, 1st Edition. Prentice Hall.
2. Caseau, Y., Guillo, P.-Y., & Levenez, E. (1993). A deductive and object-oriented approach to a complex scheduling problem. In Deductive and Object-Oriented Databases, pages 67?80.
3. Gabow, H. N., & Tarjan, R. E. (1983). A linear-time algorithm for a special case of disjoint set union. In Proceedings of the Fifteenth ACM Symposium on Theory of Computing, pages 246?251.
4. Hall, P. (1935). On representatives of subsets. J. Lond. Math. Soc. 26?30.
5. Hopcroft, J., & Karp, R. (1973). An n5/2 algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. 2: 225?231.
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A MinCumulative Resource Constraint;Integration of Constraint Programming, Artificial Intelligence, and Operations Research;2022
2. Quantum-Accelerated Global Constraint Filtering;Lecture Notes in Computer Science;2020
3. A study of constraint programming heuristics for the car-sequencing problem;Engineering Applications of Artificial Intelligence;2015-02
4. Optimizing the Cloud Service Experience Using Constraint Programming;Lecture Notes in Computer Science;2015
5. Background;Artificial Intelligence: Foundations, Theory, and Algorithms;2015