{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,9]],"date-time":"2023-10-09T18:19:37Z","timestamp":1696875577933},"reference-count":17,"publisher":"Elsevier BV","issue":"8","license":[{"start":{"date-parts":[[1994,10,1]],"date-time":"1994-10-01T00:00:00Z","timestamp":780969600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[1994,10]]},"DOI":"10.1016\/0305-0548(94)90019-1","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T16:15:45Z","timestamp":1056989745000},"page":"895-907","source":"Crossref","is-referenced-by-count":11,"title":["New heuristic solution procedures for the uniform graph partitioning problem: Extensions and evaluation"],"prefix":"10.1016","volume":"21","author":[{"given":"Hasan","family":"Pirkul","sequence":"first","affiliation":[]},{"given":"Erik","family":"Rolland","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(94)90019-1_BIB1","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","article-title":"Some simplified NP-complete graph problems","volume":"1","author":"Garey","year":"1976","journal-title":"Theor. Comoput. Sci."},{"key":"10.1016\/0305-0548(94)90019-1_BIB2","doi-asserted-by":"crossref","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","article-title":"An efficient heuristic procedure for partitioning graphs","volume":"49","author":"Kernighan","year":"1970","journal-title":"Bell Systems Technical Journal"},{"issue":"6","key":"10.1016\/0305-0548(94)90019-1_BIB3","doi-asserted-by":"crossref","DOI":"10.1287\/opre.37.6.865","article-title":"Optimization by simulated annealing: an experimental evaluation; part I, graph partioning","volume":"37","author":"Johnson","year":"1989","journal-title":"Operations Research"},{"key":"10.1016\/0305-0548(94)90019-1_BIB4","series-title":"Computer Science and Operations Research: New Developments in Their Interfaces","article-title":"Heuristic solution procedures for the graph partitioning problem","author":"Rolland","year":"1992"},{"key":"10.1016\/0305-0548(94)90019-1_BIB5","series-title":"A lagrangian based heuristic for graph partitioning. Working paper","author":"Pirkul","year":"1991"},{"key":"10.1016\/0305-0548(94)90019-1_BIB6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.27.1.1","article-title":"Lagrangean relaxation methods for solving integer programming","volume":"27","author":"Fisher","year":"1981","journal-title":"Management Science"},{"key":"10.1016\/0305-0548(94)90019-1_BIB7","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1016\/0377-2217(79)90228-5","article-title":"A survey of various tactics for generating lagrangian multipliers in the context of lagrangian duality","volume":"3","author":"Bazaara","year":"1979","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/0305-0548(94)90019-1_BIB8","series-title":"Proceedings of an International Conference on Genetic Algorithms and their Applications. Carnegie-Mellon University","article-title":"Alleles, loci, and the traveling salesman","author":"Goldberg","year":"1985"},{"key":"10.1016\/0305-0548(94)90019-1_BIB9","series-title":"Proceedings of the Third International Conference on Genetic Algorithms","article-title":"Using genetic algorithms to solve NP-complete problems","author":"De Jong","year":"1989"},{"key":"10.1016\/0305-0548(94)90019-1_BIB10","article-title":"Dynamic anticipatory routing in circuit-switched telecommunications networks","author":"Cox","year":"1991"},{"key":"10.1016\/0305-0548(94)90019-1_BIB11","series-title":"The Third International Conference on Locational Decision Making","article-title":"Discrete space allocation solutions from genetic algorithms","author":"Hosage","year":"1986"},{"key":"10.1016\/0305-0548(94)90019-1_BIB12","series-title":"Proceedings of the 3rd International Conference on Genetic Algorithms","article-title":"Using genetic algorithms to schedule flow shop releases","author":"Cleveland","year":"1989"},{"key":"10.1016\/0305-0548(94)90019-1_BIB13","article-title":"A genetic algorithm approach to multiple-fault diagnosis","author":"Liepins","year":"1991"},{"key":"10.1016\/0305-0548(94)90019-1_BIB14","series-title":"Genetic Algorithms in Search, Optimization and Machine Learning","author":"Goldberg","year":"1989"},{"key":"10.1016\/0305-0548(94)90019-1_BIB15","series-title":"Proceedings of the 3rd International Conference on Genetic Algorithms","article-title":"Some guidelines for genetic algorithms with penalty functions","author":"Richardson","year":"1989"},{"key":"10.1016\/0305-0548(94)90019-1_BIB16","article-title":"Abstract Heuristic Search Methods for Graph Partitioning","author":"Rolland","year":"1991"},{"key":"10.1016\/0305-0548(94)90019-1_BIB17","year":"1991"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054894900191?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054894900191?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T17:27:42Z","timestamp":1552930062000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054894900191"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,10]]},"references-count":17,"journal-issue":{"issue":"8","published-print":{"date-parts":[[1994,10]]}},"alternative-id":["0305054894900191"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(94)90019-1","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1994,10]]}}}