{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T07:19:59Z","timestamp":1743146399592,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031609237"},{"type":"electronic","value":"9783031609244"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-60924-4_8","type":"book-chapter","created":{"date-parts":[[2024,5,22]],"date-time":"2024-05-22T03:38:27Z","timestamp":1716349107000},"page":"97-108","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Branch and\u00a0Cut for\u00a0Partitioning a\u00a0Graph into\u00a0a\u00a0Cycle of\u00a0Clusters"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0245-9344","authenticated-orcid":false,"given":"Leon","family":"Eifler","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2698-0767","authenticated-orcid":false,"given":"Jakob","family":"Witzig","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0391-5903","authenticated-orcid":false,"given":"Ambros","family":"Gleixner","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,22]]},"reference":[{"key":"8_CR1","unstructured":"Achterberg, T.: Constraint Integer Programming. Ph.D. thesis (2007). http:\/\/nbn-resolving.de\/urn\/resolver.pl?urn:nbn:de:0297-zib-11129"},{"key":"8_CR2","doi-asserted-by":"publisher","unstructured":"Adams, W.P., Sherali, H.D.: A reformulation-linearization technique for solving discrete and continuous nonconvex problems (1999). https:\/\/doi.org\/10.1007\/978-1-4757-4388-3","DOI":"10.1007\/978-1-4757-4388-3"},{"issue":"6","key":"8_CR3","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1016\/j.orl.2013.08.007","volume":"41","author":"T Berthold","year":"2013","unstructured":"Berthold, T.: Measuring the impact of primal heuristics. OR Lett. 41(6), 611\u2013614 (2013). https:\/\/doi.org\/10.1016\/j.orl.2013.08.007","journal-title":"OR Lett."},{"key":"8_CR4","doi-asserted-by":"publisher","DOI":"10.1201\/b10905","volume-title":"Handbook of Markov Chain Monte Carlo","author":"S Brooks","year":"2011","unstructured":"Brooks, S., Gelman, A., Jones, G., Meng, X.L.: Handbook of Markov Chain Monte Carlo. CRC Press, Boca Raton (2011)"},{"issue":"1","key":"8_CR5","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/BF01581239","volume":"59","author":"S Chopra","year":"1993","unstructured":"Chopra, S., Rao, M.R.: The partition problem. Math. Prog. 59(1), 87\u2013115 (1993). https:\/\/doi.org\/10.1007\/BF01581239","journal-title":"Math. Prog."},{"issue":"6767","key":"8_CR6","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1038\/35002125","volume":"403","author":"MB Elowitz","year":"2000","unstructured":"Elowitz, M.B., Leibler, S.: A synthetic oscillatory network of transcriptional regulators. Nature 403(6767), 335\u2013338 (2000). https:\/\/doi.org\/10.1038\/35002125","journal-title":"Nature"},{"key":"8_CR7","unstructured":"Gleixner, A., Bastubbe, M., Eifler, L., et. al: The SCIP optimization suite 6.0. ZIB-Report 18-26 (2018). https:\/\/nbn-resolving.org\/urn:nbn:de:0297-zib-69361"},{"issue":"1","key":"8_CR8","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/BF01580870","volume":"47","author":"M Gr\u00f6tschel","year":"1990","unstructured":"Gr\u00f6tschel, M., Wakabayashi, Y.: Facets of the clique partitioning polytope. Math. Prog. 47(1), 367\u2013387 (1990). https:\/\/doi.org\/10.1007\/BF01580870","journal-title":"Math. Prog."},{"issue":"1222","key":"8_CR9","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1098\/rspb.1984.0024","volume":"221","author":"JL Hindmarsh","year":"1984","unstructured":"Hindmarsh, J.L., Rose, R.: A model of neuronal bursting using three coupled first order differential equations. Proc. Roy. Soc. Lond. B. Biol. Sci. 221(1222), 87\u2013102 (1984). https:\/\/doi.org\/10.1098\/rspb.1984.0024","journal-title":"Proc. Roy. Soc. Lond. B. Biol. Sci."},{"issue":"2","key":"8_CR10","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"BW Kernighan","year":"1970","unstructured":"Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 49(2), 291\u2013307 (1970). https:\/\/doi.org\/10.1002\/j.1538-7305.1970.tb01770.x","journal-title":"Bell Syst. Tech. J."},{"key":"8_CR11","doi-asserted-by":"publisher","unstructured":"Liberti, L.: Compact linearization for binary quadratic problems. 4OR 5(3). 231\u2013245 (2007). https:\/\/doi.org\/10.1007\/s10288-006-0015-3","DOI":"10.1007\/s10288-006-0015-3"},{"key":"8_CR12","doi-asserted-by":"publisher","unstructured":"Mallach, S.: Compact linearization for binary quadratic problems subject to assignment constraints. 4OR 16(3), 295\u2013309 (2018).https:\/\/doi.org\/10.1007\/s10288-017-0364-0","DOI":"10.1007\/s10288-017-0364-0"},{"issue":"1","key":"8_CR13","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF01580665","volume":"10","author":"GP McCormick","year":"1976","unstructured":"McCormick, G.P.: Computability of global solutions to factorable nonconvex programs: Part I - convex underestimating problems. Math. Prog. 10(1), 147\u2013175 (1976). https:\/\/doi.org\/10.1007\/BF01580665","journal-title":"Math. Prog."},{"issue":"1","key":"8_CR14","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/BF01589101","volume":"45","author":"M Padberg","year":"1989","unstructured":"Padberg, M.: The Boolean quadric polytope: some characteristics, facets and relatives. Math. Prog. 45(1), 139\u2013172 (1989). https:\/\/doi.org\/10.1007\/BF01589101","journal-title":"Math. Prog."},{"issue":"7","key":"8_CR15","doi-asserted-by":"publisher","first-page":"3579","DOI":"10.1021\/acs.jctc.8b00079","volume":"14","author":"B Reuter","year":"2018","unstructured":"Reuter, B., et al.: Generalized Markov state modeling method for nonequilibrium biomolecular dynamics: exemplified on Amyloid $$\\upbeta $$ conformational dynamics driven by an oscillating electric field. J. Chem. Theory Comput. 14(7), 3579\u20133594 (2018). https:\/\/doi.org\/10.1021\/acs.jctc.8b00079","journal-title":"J. Chem. Theory Comput."},{"issue":"1","key":"8_CR16","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1137\/16M1091162","volume":"16","author":"J Witzig","year":"2018","unstructured":"Witzig, J., Beckenbach, I., Eifler, L., et al.: Mixed-integer programming for cycle detection in nonreversible Markov processes. Multiscale Model. Simul. 16(1), 248\u2013265 (2018). https:\/\/doi.org\/10.1137\/16M1091162","journal-title":"Multiscale Model. Simul."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-60924-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,22]],"date-time":"2024-05-22T03:39:09Z","timestamp":1716349149000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-60924-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031609237","9783031609244"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-60924-4_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"22 May 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"ISCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"La Laguna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 May 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 May 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"isco2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}