{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:27:53Z","timestamp":1725517673512},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540857754"},{"type":"electronic","value":"9783540857761"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85776-1_20","type":"book-chapter","created":{"date-parts":[[2008,8,23]],"date-time":"2008-08-23T12:01:12Z","timestamp":1219492872000},"page":"235-246","source":"Crossref","is-referenced-by-count":7,"title":["Nested Precedence Networks with Alternatives: Recognition, Tractability, and Models"],"prefix":"10.1007","author":[{"given":"Roman","family":"Bart\u00e1k","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ond\u0159ej","family":"\u010cepek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","first-page":"641","volume-title":"Proceedings of the Twentieth International Florida AI Research Society Conference (FLAIRS)","author":"R. Bart\u00e1k","year":"2007","unstructured":"Bart\u00e1k, R., \u010cepek, O.: Temporal Networks with Alternatives: Complexity and Model. In: Proceedings of the Twentieth International Florida AI Research Society Conference (FLAIRS), pp. 641\u2013646. AAAI Press, Menlo Park (2007)"},{"key":"20_CR2","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1145\/1363686.1363729","volume-title":"Applied Computing 2008 - Proceedings of 23rd Annual ACM Symposium on Applied Computing","author":"R. Bart\u00e1k","year":"2008","unstructured":"Bart\u00e1k, R., \u010cepek, O.: Nested Temporal Networks with Alternatives: Recognition and Tractability. In: Applied Computing 2008 - Proceedings of 23rd Annual ACM Symposium on Applied Computing, vol.\u00a01, pp. 156\u2013157. ACM, New York (2008)"},{"key":"20_CR3","series-title":"Annals of Operations Research","volume-title":"Discovering Implied Constraints in Precedence Graphs with Alternatives","author":"R. Bart\u00e1k","year":"2008","unstructured":"Bart\u00e1k, R., \u010cepek, O., Surynek, P.: Discovering Implied Constraints in Precedence Graphs with Alternatives. Annals of Operations Research. Springer, Heidelberg (to appear, 2008)"},{"key":"20_CR4","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0004-3702(00)00035-7","volume":"121","author":"J.C.. Beck","year":"2000","unstructured":"Beck, J.C., Fox, M.S.: Constraint-directed techniques for scheduling alternative activities. Artificial Intelligence\u00a0121, 211\u2013250 (2000)","journal-title":"Artificial Intelligence"},{"key":"20_CR5","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1145\/2402.322389","volume":"30","author":"C. Beeri","year":"1983","unstructured":"Beeri, C., Fagin, R., Maier, D., Yannakakis, M.: On the desirability of acyclic database schemes. Journal of the ACM\u00a030, 479\u2013513 (1983)","journal-title":"Journal of the ACM"},{"key":"20_CR6","unstructured":"Horling, B., Leader, V., Vincent, R., Wagner, T., Raja, A., Zhang, S., Decker, K., Harvey, A.: The Taems White Paper, University of Massachusetts (1999), \n                    \n                      http:\/\/mas.cs.umass.edu\/research\/taems\/white\/taemswhite.pdf"},{"key":"20_CR7","unstructured":"Kim, P., Williams, B., Abramson, M.: Executing Reactive, Model-based Programs through Graph-based Temporal Planning. In: Proceedings of International Joint Conference on Artificial Intelligence (IJCAI), pp. 487\u2013493 (2001)"},{"key":"20_CR8","unstructured":"Kuster, J., Jannach, D., Friedrich, G.: Handling Alternative Activities in Resource-Constrained Project Scheduling Problems. In: Proceedings of Twentieth International Joint Conference on Artificial Intelligence (IJCAI 2007), pp. 1960\u20131965 (2007)"},{"key":"20_CR9","unstructured":"Nuijten, W., Bousonville, T., Focacci, F., Godard, D., Le Pape, C.: MaScLib: Problem description and test bed design (2003), \n                    \n                      http:\/\/www2.ilog.com\/masclib"},{"issue":"4","key":"20_CR10","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1023\/A:1025894003623","volume":"8","author":"I. Tsamardinos","year":"2003","unstructured":"Tsamardinos, I., Vidal, T., Pollack, M.E.: CTP: A New Constraint-Based Formalism for Conditional Temporal Planning. Constraints\u00a08(4), 365\u2013388 (2003)","journal-title":"Constraints"}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence: Methodology, Systems, and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85776-1_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:49:14Z","timestamp":1619524154000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85776-1_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540857754","9783540857761"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85776-1_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}