{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:32:54Z","timestamp":1759638774643},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540422877"},{"type":"electronic","value":"9783540482246"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-48224-5_8","type":"book-chapter","created":{"date-parts":[[2007,10,28]],"date-time":"2007-10-28T06:29:04Z","timestamp":1193552944000},"page":"92-103","source":"Crossref","is-referenced-by-count":7,"title":["On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities"],"prefix":"10.1007","author":[{"given":"E.","family":"Boros","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Elbassioni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V.","family":"Gurvich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.","family":"Khachiyan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Makino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,7,4]]},"reference":[{"key":"8_CR1","first-page":"307","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"R. Agrawal","year":"1996","unstructured":"R. Agrawal, H. Mannila, R. Srikant, H. Toivonen and A. I. Verkamo, Fast discovery of association rules, In U. M. Fayyad, G. Piatetsky-Shapiro, P. Smyth and R. Uthurusamy eds., Advances in Knowledge Discovery and Data Mining, 307\u2013328, AAAI Press, Menlo Park, California, 1996."},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1023\/A:1018993014297","volume":"24","author":"J. C. Bioch","year":"1998","unstructured":"J. C. Bioch, Dualization, decision lists and identification of monotone discrete functions, Annals of Mathematics and Artificial Intelligence 24 (1998) 69\u201391.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1006\/inco.1995.1157","volume":"123","author":"J. C. Bioch","year":"1995","unstructured":"J. C. Bioch and T. Ibaraki, Complexity of identification and dualization of positive Boolean functions, Information and Computation 123 (1995) 50\u201363.","journal-title":"Information and Computation"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"E. Boros, K. Elbassioni, V. Gurvich and L. Khachiyan, An incremental RNC algorithm for generating all maximal independent sets in hypergraphs of bounded dimension. DIMACS Technical Report 2000-21, Rutgers University. To appear in Parallel Processing Letters.","DOI":"10.1142\/S0129626400000251"},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1007\/3-540-45022-X_50","volume-title":"Automata, Languanges and Programming, 27th International Colloquium, ICALP 2000","author":"E. Boros","year":"2000","unstructured":"E. Boros, V. Gurvich, L. Khachiyan and K. Makino, Generating partial and multiple transversals of a hypergraph, In: Automata, Languanges and Programming, 27th International Colloquium, ICALP 2000 (Montanari, J.D.P. Rolim and E. Welzl, eds.), pp. 588\u2013599 (Springer Verlag, Berlin, Heidelberg, New York, July 2000). An extended version of this paper is to appear in SIAM J. Computing."},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/BF02283750","volume":"16","author":"Y. Crama","year":"1988","unstructured":"Y. Crama, P. L. Hammer and T. Ibaraki, Cause-effect relationships and partially defined boolean functions, Annals of Operations Research 16 (1988) 299\u2013326.","journal-title":"Annals of Operations Research"},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"1278","DOI":"10.1137\/S0097539793250299","volume":"24","author":"T. Eiter","year":"1995","unstructured":"T. Eiter and G. Gottlob, Identifying the minimal transversals of a hypergraph and related problems, SIAM Journal on Computing, 24 (1995) 1278\u20131304.","journal-title":"SIAM Journal on Computing"},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1006\/jagm.1996.0062","volume":"21","author":"M. L. Fredman","year":"1996","unstructured":"M. L. Fredman and L. Khachiyan, On the complexity of dualization of monotone disjunctive normal forms, J. Algorithms, 21 (1996) 618\u2013628.","journal-title":"J. Algorithms"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"D. Gunopulos, R. Khardon, H. Mannila, and H. Toivonen, Data mining, hypergraph transversals and machine learning. In: Proceedings of the 16th ACM-SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, (1997) pp. 12\u201315.","DOI":"10.1145\/263661.263684"},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","volume":"27","author":"D. S. Johnson","year":"1988","unstructured":"D. S. Johnson, M. Yannakakis and C. H. Papadimitriou, On generating all maximal independent sets, Information Processing Letters, 27 (1988) 119\u2013123.","journal-title":"Information Processing Letters"},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1137\/0209042","volume":"9","author":"E. Lawler","year":"1980","unstructured":"E. Lawler, J. K. Lenstra and A. H. G. Rinnooy Kan, Generating all maximal independent sets: NP-hardness and polynomial-time algorithms, SIAM Journal on Computing, 9 (1980) 558\u2013565.","journal-title":"SIAM Journal on Computing"},{"key":"8_CR12","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0166-218X(95)00092-6","volume":"69","author":"K. Makino","year":"1996","unstructured":"K. Makino and T. Ibaraki, Interor and exterior functions of Boolean functions, Discrete Applied Mathematics, 69 (1996) 209\u2013231.","journal-title":"Discrete Applied Mathematics"},{"key":"8_CR13","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/978-1-4899-0289-4_20","volume-title":"Nonlinear Optimization and Applications","author":"Mangasarian","year":"1996","unstructured":"Mangasarian, Mathematical programming in machine learning, in G. Di. Pillo and F. Giannessi eds. Nonlinear Optimization and Applications (Plenum Publishing, New York, 1996) 283\u2013295."},{"key":"8_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-017-3087-7","volume-title":"Stochastic Programming","author":"A. Pr\u00e9kopa","year":"1995","unstructured":"A. Pr\u00e9kopa, Stochastic Programming, (Kluwer, Dordrecht, 1995)."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48224-5_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T02:28:07Z","timestamp":1556936887000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48224-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540422877","9783540482246"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-48224-5_8","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}