{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:44:41Z","timestamp":1740123881008,"version":"3.37.3"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[2016,3,11]],"date-time":"2016-03-11T00:00:00Z","timestamp":1457654400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004963","name":"Seventh Framework Programme (BE)","doi-asserted-by":"publisher","award":["EU-FP7-ITN 289581"],"award-info":[{"award-number":["EU-FP7-ITN 289581"]}],"id":[{"id":"10.13039\/501100004963","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1007\/s10472-016-9496-8","type":"journal-article","created":{"date-parts":[[2016,3,11]],"date-time":"2016-03-11T11:38:31Z","timestamp":1457696311000},"page":"145-162","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Compact representations of all members of an independence system"],"prefix":"10.1007","volume":"79","author":[{"given":"Utz-Uwe","family":"Haus","sequence":"first","affiliation":[]},{"given":"Carla","family":"Michini","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,3,11]]},"reference":[{"issue":"2","key":"9496_CR1","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/s10107-010-0431-1","volume":"134","author":"E Amaldi","year":"2012","unstructured":"Amaldi, E., Bosio, S., Malucelli, F.: Hyperbolic set covering problems with competing ground-set elements. Math. Program. 134(2), 323\u2013348 (2012). doi: 10.1007\/s10107-010-0431-1","journal-title":"Math. Program."},{"key":"9496_CR2","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-642-29828-8_3","volume-title":"Variable ordering for the application of BDDs to the maximum independent set problem. In: Proceedings of the 9th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR\u201912","author":"D Bergman","year":"2012","unstructured":"Bergman, D., Cire, A.A., van Hoeve, W.J., Hooker, J.N.: Variable ordering for the application of BDDs to the maximum independent set problem. In: Proceedings of the 9th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR\u201912, pp. 34\u201349. Springer-Verlag, Berlin, Heidelberg (2012). doi: 10.1007\/978-3-642-29828-8_3"},{"issue":"2","key":"9496_CR3","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/s10732-014-9238-1","volume":"20","author":"D Bergman","year":"2014","unstructured":"Bergman, D., Cire, A.A., van Hoeve, W.J., Yunes, T.: BDD-based heuristics for binary optimization. J. Heuris. 20(2), 211\u2013234 (2014). doi: 10.1007\/s10732-014-9238-1","journal-title":"J. Heuris."},{"key":"9496_CR4","first-page":"20","volume-title":"Manipulating MDD relaxations for combinatorial optimization. In: Proceedings of the 8th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR\u201911","author":"D Bergman","year":"2011","unstructured":"Bergman, D., van Hoeve, W.J., Hooker, J.N.: Manipulating MDD relaxations for combinatorial optimization. In: Proceedings of the 8th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR\u201911, pp. 20\u201335. Springer-Verlag, Berlin, Heidelberg (2011)"},{"issue":"8","key":"9496_CR5","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"R Bryant","year":"1986","unstructured":"Bryant, R.: Graph-based algorithms for boolean function manipulation. IEEE Trans. Comput. C 35(8), 677\u2013691 (1986). doi: 10.1109\/TC.1986.1676819","journal-title":"IEEE Trans. Comput. C"},{"key":"9496_CR6","doi-asserted-by":"crossref","unstructured":"Burkard, R., \u010aela, E., Pardalos, P., Pitsoulis, L.: The quadratic assignment problem. In: Du, D.Z., Pardalos, P. (eds.) Handbook of Combinatorial Optimization, vol. 3, pp. chap. 13, pp. 241\u2013337. Kluwer Academic Publishers (1998)","DOI":"10.1007\/978-1-4613-0303-9_27"},{"key":"9496_CR7","doi-asserted-by":"publisher","unstructured":"Cuthill, E., McKee, J.: Reducing the bandwidth of sparse symmetric matrices. In: Proceedings of the 1969 24th National Conference, ACM \u201969, pp. 157\u2013172. ACM, New York (1969). doi: 10.1145\/800195.805928","DOI":"10.1145\/800195.805928"},{"key":"9496_CR8","doi-asserted-by":"publisher","unstructured":"Flajolet, P., Fusy, \u0116., Pivoteau, C.: Boltzmann sampling of unlabeled structures. In: Panario, D., Sedgewick, R. (eds.) Proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2007, pp. 201\u2013211. SIAM, New Orleans (2007). doi: 10.1137\/1.9781611972979.5","DOI":"10.1137\/1.9781611972979.5"},{"issue":"1","key":"9496_CR9","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/BF02022039","volume":"4","author":"H Hamacher","year":"1985","unstructured":"Hamacher, H., Queyranne, M.: K best solutions to combinatorial optimization problems. Ann. Oper. Res. 4(1), 123\u2013143 (1985). doi: 10.1007\/BF02022039","journal-title":"Ann. Oper. Res."},{"key":"9496_CR10","unstructured":"Harary, F.: Graph Theory. Addison-Wesley Series in Mathematics, Perseus Books. https:\/\/books.google.com\/books?id=9nOljWrLzAAC (1994)"},{"issue":"2","key":"9496_CR11","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/s10107-003-0384-8","volume":"96","author":"UU Haus","year":"2003","unstructured":"Haus, U.U., K\u00f6ppe, M., Weismantel, R.: A primal all-integer algorithm based on irreducible solutions. Math. Program. Series B 96(2), 205\u2013246 (2003). doi: 10.1007\/s10107-003-0384-8","journal-title":"Math. Program. Series B"},{"key":"9496_CR12","doi-asserted-by":"publisher","unstructured":"Henk, M., K\u00f6ppe, M., Weismantel, R.: Integral decomposition of polyhedra and some applications in mixed integer programming. Math. Program. Series B 94(2\u20133), 193\u2013206 (2003). doi: 10.1007\/s10107-002-0315-0","DOI":"10.1007\/s10107-002-0315-0"},{"key":"9496_CR13","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-642-15396-9_23","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2010, Lecture Notes in Computer Science, vol. 6308","author":"S Hoda","year":"2010","unstructured":"Hoda, S., van Hoeve, W.J., Hooker, J.: A systematic approach to MDD-based constraint programming. In: Cohen, D. (ed.) Principles and Practice of Constraint Programming \u2013 CP 2010, Lecture Notes in Computer Science, vol. 6308, pp. 266\u2013280. Springer, Berlin Heidelberg (2010). doi: 10.1007\/978-3-642-15396-9_23"},{"key":"9496_CR14","doi-asserted-by":"crossref","unstructured":"Johnson, D.S., Trick, M.A. (eds.): Clique, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, DIMACS, vol. 26. American Mathematical Society. http:\/\/dimacs.rutgers.edu\/Volumes\/Vol26.html (1996)","DOI":"10.1090\/dimacs\/026"},{"issue":"4","key":"9496_CR15","doi-asserted-by":"crossref","first-page":"985","DOI":"10.1002\/j.1538-7305.1959.tb01585.x","volume":"38","author":"CY Lee","year":"1959","unstructured":"Lee, C.Y.: Representation of switching circuits by binary-decision programs. Bell Syst. Tech. J. 38(4), 985\u2013999 (1959)","journal-title":"Bell Syst. Tech. J."},{"key":"9496_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-58940-9","volume-title":"Algorithms and Data Structures in VLSI Design: OBDD \u2013 Foundations and Applications","author":"C Meinel","year":"1998","unstructured":"Meinel, C., Theobald, T.: Algorithms and Data Structures in VLSI Design: OBDD \u2013 Foundations and Applications. Springer-Verlag New York, Inc., Secaucus (1998)"},{"key":"9496_CR17","unstructured":"Resende, M.G.C.: Steiner triple covering problem instances. Available at http:\/\/www2.research.att.com\/mgcr\/data\/index.html"},{"key":"9496_CR18","unstructured":"SBCL community: Sbcl 1.1.5, an implementation of ANSI Common Lisp. Available as free software from http:\/\/www.sbcl.org"},{"key":"9496_CR19","volume-title":"Combinatorial Optimization","author":"A Schrijver","year":"2002","unstructured":"Schrijver, A.: Combinatorial Optimization. Springer, Berlin, Germany (2002)"},{"key":"9496_CR20","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/BFb0015427","volume-title":"Algorithms and Computations, Lecture Notes in Computer Science, vol. 1004","author":"K Sekine","year":"1995","unstructured":"Sekine, K., Imai, H., Tani, S.: Computing the Tutte polynomial of a graph of moderate size. In: Staples, J., Eades, P., Katoh, N., Moffat, A. (eds.) Algorithms and Computations, Lecture Notes in Computer Science, vol. 1004, pp. 224\u2013233. Springer, Berlin Heidelberg (1995). doi: 10.1007\/BFb0015427"},{"issue":"2","key":"9496_CR21","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/0020-0190(79)90130-3","volume":"9","author":"P Yao","year":"1979","unstructured":"Yao, P.: Graph 2-isomorphism is NP-complete. Inf. Process. Lett. 9(2), 68\u201372 (1979). doi: 10.1016\/0020-0190(79)90130-3","journal-title":"Inf. Process. Lett."}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-016-9496-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10472-016-9496-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-016-9496-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-016-9496-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:58:22Z","timestamp":1559138302000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10472-016-9496-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3,11]]},"references-count":21,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2017,3]]}},"alternative-id":["9496"],"URL":"https:\/\/doi.org\/10.1007\/s10472-016-9496-8","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"type":"print","value":"1012-2443"},{"type":"electronic","value":"1573-7470"}],"subject":[],"published":{"date-parts":[[2016,3,11]]}}}