{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T03:58:20Z","timestamp":1777607900026,"version":"3.51.4"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,1,28]],"date-time":"2010-01-28T00:00:00Z","timestamp":1264636800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2011,8]]},"DOI":"10.1007\/s10878-009-9284-z","type":"journal-article","created":{"date-parts":[[2010,1,27]],"date-time":"2010-01-27T15:36:25Z","timestamp":1264606585000},"page":"202-216","source":"Crossref","is-referenced-by-count":1,"title":["Optimal wafer cutting in shuttle layout problems"],"prefix":"10.1007","volume":"22","author":[{"given":"Lasse","family":"Nisted","sequence":"first","affiliation":[]},{"given":"David","family":"Pisinger","sequence":"additional","affiliation":[]},{"given":"Avri","family":"Altman","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,1,28]]},"reference":[{"key":"9284_CR1","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/j.comgeo.2004.05.006","volume":"30","author":"M Andersson","year":"2005","unstructured":"Andersson M, Levcopoulos C, Gudmundsson J (2005) Chips on wafers. Comput Geom Theory Appl 30:95\u2013111","journal-title":"Comput Geom Theory Appl"},{"issue":"3","key":"9284_CR2","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1287\/moor.12.3.522","volume":"12","author":"E Balas","year":"1987","unstructured":"Balas E, Chvatal V, Nesetril J (1987) On the maximum weight clique problem. Math Oper Res 12(3):522\u2013535","journal-title":"Math Oper Res"},{"key":"9284_CR3","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/0167-6377(90)90057-C","volume":"9","author":"R Carraghan","year":"1990","unstructured":"Carraghan R, Pardalos P (1990) An exact algorithm for the maximum clique problem. Oper Res Lett 9:375\u2013382","journal-title":"Oper Res Lett"},{"key":"9284_CR4","doi-asserted-by":"crossref","unstructured":"Chen S, Lynn EC (2003) Effective placement of chips on a shuttle mask. In: Proc of SPIE, vol\u00a05130, pp\u00a0681\u2013688","DOI":"10.1117\/12.504220"},{"key":"9284_CR5","doi-asserted-by":"crossref","unstructured":"Chen C-C, Mak W-K (2006) A multi-technology-process reticle floorplanner and wafer dicing planner for multi-project wafers. In: Asian and South Pacific design automation conference","DOI":"10.1145\/1118299.1118478"},{"issue":"6","key":"9284_CR6","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1287\/opre.9.6.849","volume":"9","author":"PC Gilmore","year":"1961","unstructured":"Gilmore PC, Gomory RE (1961) A linear programming approach to the cutting-stock problem. Oper Res 9(6):849\u2013859","journal-title":"Oper Res"},{"key":"9284_CR7","doi-asserted-by":"crossref","unstructured":"Kahng AB, Mandoiu I, Wang Q, Xu X, Zelikovsky AZ (2004) Multi-project reticle floorplanning and wafer dicing. In: Proc of ISPD, pp\u00a070\u201377","DOI":"10.1145\/981066.981082"},{"issue":"1","key":"9284_CR8","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1147\/rd.471.0057","volume":"47","author":"R Lougee-Heimer","year":"2003","unstructured":"Lougee-Heimer R (2003) The Common Optimization INterface for Operations Research: promoting open-source software in the operations research community. IBM J Res Dev 47(1):57\u201366","journal-title":"IBM J Res Dev"},{"key":"9284_CR9","unstructured":"Nisted L (2006) Solving the shuttle layout problem using decomposition. Technical Report 06-02-6 (D\u00a0Pisinger, supervisor), DIKU, University of Copenhagen, Denmark"},{"issue":"4","key":"9284_CR10","first-page":"424","volume":"8","author":"PRJ \u00d6sterg\u00e5rd","year":"2001","unstructured":"\u00d6sterg\u00e5rd PRJ (2001) A new algorithm for the maximum-weight clique problem. Nord J Comput 8(4):424\u2013436","journal-title":"Nord J Comput"},{"issue":"1\u20133","key":"9284_CR11","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/S0166-218X(01)00290-6","volume":"120","author":"PRJ \u00d6sterg\u00e5rd","year":"2002","unstructured":"\u00d6sterg\u00e5rd PRJ (2002) A fast algorithm for the maximum clique problem. Discrete Appl Math 120(1\u20133):197\u2013207","journal-title":"Discrete Appl Math"},{"key":"9284_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04565-7","volume-title":"Approximation algorithms","author":"VV Vazirani","year":"2003","unstructured":"Vazirani VV (2003) Approximation algorithms. Springer, Berlin"},{"key":"9284_CR13","volume-title":"Integer programming","author":"LA Wolsey","year":"1998","unstructured":"Wolsey LA (1998) Integer programming. Wiley-Interscience, New York"},{"key":"9284_CR14","unstructured":"Wu M-C, Lin R-B (2005) Reticle floorplanning and wafer dicing for multiple project wafers. In: ISQED 2005, pp\u00a0610\u2013615"},{"key":"9284_CR15","doi-asserted-by":"crossref","unstructured":"Xu G, Tian R, Wong DF, Reich A (2003) Shuttle mask floorplanning. In: Proc of SPIE, vol\u00a05256, pp\u00a0185\u2013194","DOI":"10.1117\/12.517568"},{"key":"9284_CR16","doi-asserted-by":"crossref","unstructured":"Xu G, Tian R, Pan DZ, Wong MDF (2004) A multi-objective floorplanner for shuttle mask optimization. In: Proc SPIE, vol\u00a05567, pp\u00a0340\u2013350","DOI":"10.1117\/12.569345"},{"key":"9284_CR17","doi-asserted-by":"crossref","unstructured":"Xu G, Tian R, Pan DZ, Wong MDF (2005) CMP aware shuttle mask floorplanning. In: Asian and South Pacific design automation conference","DOI":"10.1145\/1120725.1120836"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-009-9284-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-009-9284-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-009-9284-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:18:15Z","timestamp":1559261895000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-009-9284-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1,28]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,8]]}},"alternative-id":["9284"],"URL":"https:\/\/doi.org\/10.1007\/s10878-009-9284-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,1,28]]}}}