{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T19:52:11Z","timestamp":1760644331697},"reference-count":23,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1998,4,1]],"date-time":"1998-04-01T00:00:00Z","timestamp":891388800000},"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":["European Journal of Operational Research"],"published-print":{"date-parts":[[1998,4]]},"DOI":"10.1016\/s0377-2217(97)00287-7","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:55:41Z","timestamp":1052783741000},"page":"500-521","source":"Crossref","is-referenced-by-count":17,"title":["Solution of large weighted equicut problems"],"prefix":"10.1016","volume":"106","author":[{"given":"Mauro","family":"Dell'Amico","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Trubian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(97)00287-7_BIB1","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1287\/opre.36.3.493","article-title":"An application of combinatorial optimization to statistical physics and circuit layout design","volume":"36","author":"Barahona","year":"1988","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(97)00287-7_BIB2","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/BF02614373","article-title":"A branch-and-cut algorithm for the equicut problem","volume":"78","author":"Brunetta","year":"1997","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(97)00287-7_BIB3","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/BF01588778","article-title":"The equipartition polytope I: Formulation, dimension and basic facets","volume":"49","author":"Conforti","year":"1990","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(97)00287-7_BIB4","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/BF01588779","article-title":"The equipartition polytope II: Valid inequalities and facets","volume":"49","author":"Conforti","year":"1990","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(97)00287-7_BIB5","doi-asserted-by":"crossref","first-page":"828","DOI":"10.1109\/TCAD.1987.1270326","article-title":"Simultaneous floor planning and global routing for hierarchical building block layout","volume":"6","author":"Dai","year":"1987","journal-title":"IEEE Transactions on CAD of ICs Systems"},{"key":"10.1016\/S0377-2217(97)00287-7_BIB6","series-title":"Meta-Heuristics 1995: The State of the Art","first-page":"361","article-title":"A new tabu search approach to the 0\u2013l equicut problem","author":"Dell'Amico","year":"1996"},{"key":"10.1016\/S0377-2217(97)00287-7_BIB7","series-title":"Performances of various computers using standard linear equations software, CS-89-85","author":"Dongarra","year":"1995"},{"key":"10.1016\/S0377-2217(97)00287-7_BIB8","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1109\/TCAD.1985.1270101","article-title":"A procedure for placement of standard-cell vlsi circuits","volume":"1","author":"Dunlop","year":"1985","journal-title":"IEEE Transactions on CAD of ICs Systems"},{"key":"10.1016\/S0377-2217(97)00287-7_BIB9","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1002\/net.3230200205","article-title":"A class of bounded approximation algorithms for graph partitioning","volume":"20","author":"Feo","year":"1990","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(97)00287-7_BIB10","series-title":"ACM\/IEEE 19th Design Autom. Conference Las Vegas","first-page":"175","article-title":"A linear-time heuristic for improving network partitions","author":"Fiduccia","year":"1982"},{"key":"10.1016\/S0377-2217(97)00287-7_BIB11","unstructured":"C. Fleurent, F. Glover, Improved constructive multistart strategies for the quadratic assignment problem, Technical report, Graduate School of Business, University of Colorado."},{"key":"10.1016\/S0377-2217(97)00287-7_BIB12","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0377-2217(97)00287-7_BIB13","article-title":"Tabu Search Fundamentals and Uses","author":"Glover","year":"1995"},{"key":"10.1016\/S0377-2217(97)00287-7_BIB14","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1287\/opre.37.6.865","article-title":"Optimization by simulated annealing: An experimental evaluation; Part 1, graph partitioning","volume":"37","author":"Johnson","year":"1989","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(97)00287-7_BIB15","doi-asserted-by":"crossref","first-page":"291","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 System Technical Journal"},{"key":"10.1016\/S0377-2217(97)00287-7_BIB16","doi-asserted-by":"crossref","first-page":"975","DOI":"10.1007\/BF01009452","article-title":"Optimization by simulated annealing: Quantitative studies","volume":"34","author":"Kirkpatrick","year":"1984","journal-title":"Journal of Statistical Physics"},{"key":"10.1016\/S0377-2217(97)00287-7_BIB17","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"Science"},{"key":"10.1016\/S0377-2217(97)00287-7_BIB18","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1287\/opre.42.4.677","article-title":"A greedy randomized adaptive search procedure for the two-partition problem","volume":"42","author":"Laguna","year":"1994","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(97)00287-7_BIB19","series-title":"Modern Heuristic Techniques for Combinatorial Problems","article-title":"Tabu search","author":"Laguna","year":"1993"},{"key":"10.1016\/S0377-2217(97)00287-7_BIB20","doi-asserted-by":"crossref","first-page":"895","DOI":"10.1016\/0305-0548(94)90019-1","article-title":"New heuristic solution procedures for the uniform graph partitioning problem: Extensions and evaluation","volume":"21","author":"Pirkul","year":"1994","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(97)00287-7_BIB21","series-title":"A lagrangean based heuristic uniform graph partitioning problem","author":"Pirkul","year":"1995"},{"key":"10.1016\/S0377-2217(97)00287-7_BIB22","series-title":"Computer Science and Operations Re search: New Developments in their Interfaces","article-title":"Heuristic solution procedures for the graph partitioning problem","author":"Rolland","year":"1992"},{"key":"10.1016\/S0377-2217(97)00287-7_BIB23","doi-asserted-by":"crossref","unstructured":"E. Rolland, H. Pirkul, F. Glover, A tabu search for graph partitioning, in: Metaheuristics in optimization, Annals of Operation Research, to appear.","DOI":"10.1007\/BF02125455"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797002877?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797002877?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T12:56:04Z","timestamp":1556110564000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221797002877"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,4]]},"references-count":23,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1998,4]]}},"alternative-id":["S0377221797002877"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(97)00287-7","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1998,4]]}}}