Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Software
Reference22 articles.
1. Bessiere, C. (2006). Constraint propagation. Foundations of Artificial Intelligence, 2, 29–83.
2. Cambazard, H., & O’Sullivan, B. (2010). Propagating the bin packing constraint using linear programming. In Cohen, D. (Ed.) International Conference on Principles and Practice of Constraint Programming (pp. 129–136). Berlin: Springer.
3. Dupuis, J., Schaus, P., & Deville, Y. (2010). Consistency check for the bin packing constraint revisited. In International Conference on Integration of Artificial Intelligence (AI) and Operations Research (OR) Techniques in Constraint Programming, pp. 117–122. Springer.
4. Edmonds, J., & Karp, R.M. (1972). Theoretical improvements in algorithmic efficiency for network flow problems. Journal of the ACM (JACM), 19(2), 248–264.
5. Ford, L.R., & Fulkerson, D.R. (1955). A simple algorithm for finding maximal network flows and an application to the Hitchcock problem. DTIC Document: Tech. rep.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献