Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, MA, 1974.
2. N. Bleuzen-Guernalec and A. Colmerauer. Narrowing a 2n-block of sortings in $O(n log n)$. Lecture Notes in Computer Science, 1330:2–16, 1997.
3. N. Bleuzen-Guernalec and A. Colmerauer. Optimal narrowing of a block of sortings in optimal time. Constraints: An international Journal, 5(1–2):85–118, 2000.
4. Joseph Cheriyan and Kurt Mehlhorn. Algorithms for dense graphs and networks on the random access computer. Algorithmica, 15(5):521–549, 1996.
5. F. Glover. Maximum matchings in a convex bipartite graph. Naval Res. Logist. Quart., 14:313–316, 1967.
Cited by
21 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Preliminary Results on Constraint Programming and Branch & Bound Algorithms for the Cyclic Bandwidth Sum Problem;Proceedings of Seventh International Congress on Information and Communication Technology;2022-07-27
2. A Parallel Algorithm for GAC Filtering of the Alldifferent Constraint;Integration of Constraint Programming, Artificial Intelligence, and Operations Research;2022
3. Constraint programming and operations research;Constraints;2017-12-29
4. Exploiting Constraints;Inductive Logic Programming;2012
5. The AllDifferent Constraint with Precedences;Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems;2011