{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:19:34Z","timestamp":1725470374212},"reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540325376"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-32539-5_50","type":"book-chapter","created":{"date-parts":[[2006,9,11]],"date-time":"2006-09-11T10:54:52Z","timestamp":1157972092000},"page":"315-320","source":"Crossref","is-referenced-by-count":0,"title":["LP-based Genetic Algorithm for the Minimum Graph Bisection Problem"],"prefix":"10.1007","author":[{"given":"Michael","family":"Armbruster","sequence":"first","affiliation":[]},{"given":"Marzena","family":"F\u00fcgenschuh","sequence":"additional","affiliation":[]},{"given":"Christoph","family":"Helmberg","sequence":"additional","affiliation":[]},{"given":"Nikolay","family":"Jetchev","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Martin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"50_CR1","unstructured":"T. Achterberg. SCIP-a framework to integrate constraint and mixed integer programming. ZIB-Report, 2004."},{"issue":"2","key":"50_CR2","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF02592023","volume":"36","author":"F. Barahona","year":"1986","unstructured":"F. Barahona and A. R. Mahjoub. On the cut polytope. Math. Programming, 36(2):157\u2013173, 1986.","journal-title":"Math. Programming"},{"issue":"7","key":"50_CR3","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1109\/12.508322","volume":"45","author":"T. N. Bui","year":"1996","unstructured":"T. N. Bui and B. R. Moon. Genetic algorithm and graph partitioning. IEEE Trans. Comput., 45(7):841\u2013855, 1996.","journal-title":"IEEE Trans. Comput."},{"key":"50_CR4","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0025-5610(96)00005-6","volume":"74","author":"C. E. Ferreira","year":"1996","unstructured":"C. E. Ferreira, A. Martin, C. C. de Souza, R. Weismantel, and L. A. Wolsey. Formulations and valid inequalities for the node capacitated graph partitioning problem. Math. Programming, 74:247\u2013267, 1996.","journal-title":"Math. Programming"},{"issue":"2","key":"50_CR5","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/BF01581107","volume":"81","author":"C. E. Ferreira","year":"1998","unstructured":"C. E. Ferreira, A. Martin, C. C. de Souza, R. Weismantel, and L. A. Wolsey. The node capacitated graph partitioning problem: A computational study. Math. Programmming, 81(2):229\u2013256, 1998.","journal-title":"Math. Programmming"},{"key":"50_CR6","unstructured":"M. R. Garey and D. S. Johnson. Computers and Intractability. W.H. Freeman and Company, 1979."},{"key":"50_CR7","volume-title":"Stochastic Local Search: Foundations and Applications","author":"H. H. Hoos","year":"2004","unstructured":"H. H. Hoos and T. St\u00fctzle. Stochastic Local Search: Foundations and Applications. Morgan Kaufmann, San Francisco (CA), 2004."},{"issue":"3","key":"50_CR8","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/BF01582072","volume":"63","author":"M. J\u00fcnger","year":"1994","unstructured":"M. J\u00fcnger, A. Martin, G. Reinelt, and R. Weismantel. Quadratic 0\/1 optimization and a decomposition approach for the placement of electronic circuits. Math. Programmming B, 63(3):257\u2013279, 1994.","journal-title":"Math. Programmming B"},{"issue":"11\u201313","key":"50_CR9","doi-asserted-by":"publisher","first-page":"1325","DOI":"10.1016\/S0895-7177(03)90134-8","volume":"38","author":"K. Kohmoto","year":"2003","unstructured":"K. Kohmoto, K. Katayaman, and H. Narihisa. Performance of a genetic algorithm for the graph partitioning problem. Math. Comput. Modelling, 38(11\u201313): 1325\u20131333, 2003.","journal-title":"Math. Comput. Modelling"},{"key":"50_CR10","doi-asserted-by":"crossref","unstructured":"H. Maini, K. Mehrotra, C. Mohan, and S. Ranka. Genetic algorithms for graph partitioning and incremental graph partitioning. In Supercomputing\u2019 94: Proceedings of the 1994 ACM\/IEEE conference on Supercomputing, pages 449\u2013457, New York, NY, USA, 1994. ACM Press.","DOI":"10.1145\/602770.602848"}],"container-title":["Operations Research Proceedings","Operations Research Proceedings 2005"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-32539-5_50.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:53:45Z","timestamp":1605646425000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-32539-5_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540325376"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-32539-5_50","relation":{},"subject":[]}}