{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T00:42:07Z","timestamp":1778287327708,"version":"3.51.4"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2004,4,28]],"date-time":"2004-04-28T00:00:00Z","timestamp":1083110400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2005,1]]},"DOI":"10.1007\/s10107-004-0512-0","type":"journal-article","created":{"date-parts":[[2004,4,27]],"date-time":"2004-04-27T01:35:15Z","timestamp":1083029715000},"page":"185-203","source":"Crossref","is-referenced-by-count":25,"title":["On the generation of circuits and minimal forbidden sets"],"prefix":"10.1007","volume":"102","author":[{"given":"Frederik","family":"Stork","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Uetz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2004,4,28]]},"reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1016\/0377-2217(93)90062-R","volume":"67","author":"Olagu\u00edbel","year":"1993","unstructured":"Alvarez-Vald\u00e9s Olagu\u00edbel, R., Tamarit Goerlich, J.M.: The project scheduling polyhedron: Dimension, facets, and liftig theorems. Eur. J. Oper. Res. 67, 204?220 (1993)","journal-title":"Eur. J. Oper. Res."},{"key":"CR2","unstructured":"Balas, E.: Project scheduling with resource constraints. In: Beale, E.M.L., (ed.), Applications of Mathematical Programming Techniques. The English University Press, London, 1970"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/BF02237953","volume":"26","author":"Bartusch","year":"1981","unstructured":"Bartusch, M.: An algorithm for generating all maximal independent subsets of posets. Computing 26, 343?354 (1981)","journal-title":"Computing"},{"key":"CR4","unstructured":"Bartusch, M.: Optimierung von Netzpl\u00e4nen mit Anordnungsbeziehungen bei knappen Betriebsmitteln. PhD thesis, Rheinisch-Westf\u00e4lische Technische Hochschule Aachen, Aachen, Germany, 1984"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF02283745","volume":"16","author":"Bartusch","year":"1988","unstructured":"Bartusch, M., M\u00f6hring, R.H., Radermacher, F.J.: Scheduling project networks with resource constraints and time windows. Ann. Oper. Res. 16, 201?240 (1988)","journal-title":"Ann. Oper. Res."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"1624","DOI":"10.1137\/S0097539701388768","volume":"31","author":"Boros","year":"2002","unstructured":"Boros, E., Elbassioni, K., Khachiyan, L., Makino, K.: Dual-bounded generating problems: All minimal integer solutions for a monotone system of linear inequalities. SIAM J. Comput. 31, 1624?1643 (2002)","journal-title":"SIAM J. Comput."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1080\/10556789808805708","volume":"10","author":"Boros","year":"1998","unstructured":"Boros, E., Gurvich, V., Hammer, P.L.: Dual subimplicants of positive boolean functions. Optim. Meth. Softw. 10, 147?156 (1998)","journal-title":"Optim. Meth. Softw."},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. SIAM Monographs on Discrete Mathematics and Applications. Society for Industrial and Applied Mathematics. Philadelphia, PA, 1999","DOI":"10.1137\/1.9780898719796"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/S0167-5060(08)70731-3","volume":"1","author":"Chv\u00e1tal","year":"1977","unstructured":"Chv\u00e1tal, V., Hammer, P.L.: Aggregation of inequalities in integer programming. Ann. Disc. Math. 1, 145?162 (1977)","journal-title":"Ann. Disc. Math."},{"key":"CR10","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York, 1979"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1002\/net.3230130103","volume":"13","author":"Igelmund","year":"1983","unstructured":"Igelmund, G., Radermacher, F.J.: Algorithmic approaches to preselective strategies for stochastic scheduling problems. Networks 13, 29?48 (1983)","journal-title":"Networks"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/net.3230130102","volume":"13","author":"Igelmund","year":"1983","unstructured":"Igelmund, G., Radermacher, F.J.: Preselective strategies for the optimization of stochastic project networks under resource constraints. Networks 13, 1?28 (1983)","journal-title":"Networks"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","volume":"27","author":"Johnson","year":"1988","unstructured":"Johnson, D.S., Yannakakis, M., Papadimitriou, C.H.: On generating all maximal independent sets. Inf. Processing Lett. 27, 119?123 (1988)","journal-title":"Inf. Processing Lett."},{"key":"CR14","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/S0377-2217(96)00170-1","volume":"96","author":"Kolisch","year":"1996","unstructured":"Kolisch, R., Sprecher, A.: PSPLIB - A project scheduling problem library. Eur. J. Oper. Res. 96, 205?216 (1996)","journal-title":"Eur. J. Oper. Res."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1137\/0209042","volume":"9","author":"Lawler","year":"1980","unstructured":"Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Generating all maximal independent sets: NP-hardness and polynomial-time algorithms. SIAM J. Comput. 9, 558?565 (1980)","journal-title":"SIAM J. Comput."},{"key":"CR16","doi-asserted-by":"crossref","unstructured":"M\u00f6hring, R.H.: Algorithmic aspects of comparability graphs and interval graphs. In: Rival, I., (ed.), Graphs and Order, NATO Advanced Science Institute Series, D. Reidel Publishing Company, Dordrecht, 1985, pp. 41?101","DOI":"10.1007\/978-94-009-5315-4_2"},{"key":"CR17","doi-asserted-by":"crossref","unstructured":"M\u00f6hring, R.H., Skutella, M., Stork, F.: Scheduling with AND\/OR precedence constraints. SIAM J. Comput. 2004. To appear","DOI":"10.1137\/S009753970037727X"},{"key":"CR18","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading, MA, 1994"},{"key":"CR19","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1287\/mnsc.16.1.93","volume":"16","author":"Pritsker","year":"1969","unstructured":"Pritsker, A.A.B., Watters, L.J., Wolfe, P.M.: Multi project scheduling with limited resources: A zero-one programming approach. Manage. Sci. 16, 93?108 (1969)","journal-title":"Manage. Sci."},{"key":"CR20","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1137\/0212053","volume":"12","author":"Provan","year":"1983","unstructured":"Provan, J.S., Ball, M.O.: The complexity of counting cuts and of the probability that a graph is connected. SIAM J. Comput. 12, 777?788 (1983)","journal-title":"SIAM J. Comput."},{"key":"CR21","unstructured":"PSPLIB. http:\/\/www.bwl.uni-kiel.de\/Prod\/psplib\/, 2000"},{"key":"CR22","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/BF02022042","volume":"4","author":"Radermacher","year":"1985","unstructured":"Radermacher, F.J.: Scheduling of project networks. Ann. Oper. Res. 4, 227?252 (1985)","journal-title":"Ann. Oper. Res."},{"key":"CR23","unstructured":"Roy, B., Sussmann, B.: Les probl\u00e8mes d?ordonnancement avec contraintes disjonctives. Note D.S. 9 bis, SEMA, Paris, France, 1964"},{"key":"CR24","unstructured":"Stork, F.: Stochastic Resource-Constrained Project Scheduling. PhD thesis, Institut f\u00fcr Mathematik, Technische Universit\u00e4t Berlin, Berlin, Germany, 2001"},{"key":"CR25","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","volume":"8","author":"Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of computing the permanent. Theor. Comput. Sci. 8, 189?201 (1979)","journal-title":"Theor. Comput. Sci."},{"key":"CR26","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1137\/0208032","volume":"8","author":"Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of enumeration and reliability problems. SIAM J. Comput. 8, 410?421 (1979)","journal-title":"SIAM J. Comput."},{"key":"CR27","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1137\/0603036","volume":"3","author":"Yannakakis","year":"1982","unstructured":"Yannakakis, M.: The complexity of the partial order dimension problem. SIAM J. Algebraic Disc. Meth. 3, 351?358 (1982)","journal-title":"SIAM J. Algebraic Disc. Meth."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-004-0512-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-004-0512-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-004-0512-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T05:49:56Z","timestamp":1559108996000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-004-0512-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,4,28]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,1]]}},"alternative-id":["512"],"URL":"https:\/\/doi.org\/10.1007\/s10107-004-0512-0","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,4,28]]}}}