{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:37:03Z","timestamp":1759847823045,"version":"3.40.3"},"publisher-location":"Cham","reference-count":7,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319070001"},{"type":"electronic","value":"9783319070018"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07001-8_45","type":"book-chapter","created":{"date-parts":[[2014,7,9]],"date-time":"2014-07-09T15:13:03Z","timestamp":1404918783000},"page":"333-339","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Mathematical Formulations for the Acyclic Partitioning Problem"],"prefix":"10.1007","author":[{"given":"Jenny","family":"Nossack","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erwin","family":"Pesch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,7,10]]},"reference":[{"key":"45_CR1","doi-asserted-by":"crossref","unstructured":"Cong, J., Li, Z., & Bagrodia, R. (1994). Acyclic multi-way partitioning of Boolean networks. In Proceedings of the 31st Annual Design Automation Conference (pp. 670\u2013675). New York: ACM.","DOI":"10.1145\/196244.196609"},{"key":"45_CR2","volume-title":"Computers and intractability\u2014a guide to the theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability\u2014a guide to the theory of NP-Completeness. New York: Freeman."},{"key":"45_CR3","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/BF01589097","volume":"45","author":"M Gr\u00f6tschel","year":"1989","unstructured":"Gr\u00f6tschel, M., & Wakabayashi, Y. (1989). A cutting plane algorithm for a clustering problem. Mathematical Programming, 45, 59\u201396.","journal-title":"Mathematical Programming"},{"key":"45_CR4","unstructured":"Hadlock, F. O. (1974). Minimum spanning forests of bounded trees. In Proceedings of the 5th Southeastern Conference on Combinatorics, Graph Theory, and Computing, (pp. 449\u2013460). Winnipeg: Utilitas Mathematica Publishing."},{"key":"45_CR5","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1147\/rd.183.0217","volume":"18","author":"JA Lukes","year":"1974","unstructured":"Lukes, J. A. (1974). Efficient algorithm for the partitioning of trees. IBM Journal of Research and Development, 18, 217\u2013224.","journal-title":"IBM Journal of Research and Development"},{"key":"45_CR6","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1145\/321043.321046","volume":"7","author":"CE Miller","year":"1960","unstructured":"Miller, C. E., Tucker, A. W., & Zemlin, R. A. (1960). Integer programming formulation of traveling salesman problems. Journal of the ACM, 7, 326\u2013329.","journal-title":"Journal of the ACM"},{"key":"45_CR7","doi-asserted-by":"crossref","unstructured":"Nossack, J., & Pesch, E. (2014). A branch-and-bound algorithm for the acyclic partitioning problem. Computers & Operations Research, 41, 174\u2013184.","DOI":"10.1016\/j.cor.2013.08.013"}],"container-title":["Operations Research Proceedings","Operations Research Proceedings 2013"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07001-8_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T06:06:26Z","timestamp":1676873186000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-07001-8_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319070001","9783319070018"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07001-8_45","relation":{},"ISSN":["0721-5924"],"issn-type":[{"type":"print","value":"0721-5924"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"10 July 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}