Author:
Zanarini Alessandro,Pesant Gilles
Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. Bregman, L.M.: Some Properties of Nonnegative Matrices and their Permanents. Soviet Mathematics Doklady 14(4), 945–949 (1973)
2. Gomes, C., Shmoys, D.: Completing Quasigroups or Latin Squares: A Structured Graph Coloring Problem. In: COLOR 2002: Proceedings of Computational Symposium on Graph Coloring and Generalizations, pp. 22–39 (2002)
3. Jurkat, W.B., Ryser, H.J.: Matrix Factorizations of Determinants and Permanents. Journal of Algebra 3, 1–27 (1966)
4. Liang, H., Bai, F.: An Upper Bound for the Permanent of (0,1)-Matrices. Linear Algebra and its Applications 377, 291–295 (2004)
5. Melo, R.A., Urrutia, S., Ribeiro, C.C.: The traveling tournament problem with predefined venues. Journal of Scheduling 12(6), 607–622 (2009)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Accelerating Counting-Based Search;Integration of Constraint Programming, Artificial Intelligence, and Operations Research;2018
2. Solving the Traveling Tournament Problem with Predefined Venues by Parallel Constraint Programming;Mining Intelligence and Knowledge Exploration;2018
3. Counting-Based Search: Branching Heuristics for Constraint Satisfaction Problems;Journal of Artificial Intelligence Research;2012-02-26
4. Recovering Indirect Solution Densities for Counting-Based Branching Heuristics;Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems;2011