{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T12:21:08Z","timestamp":1763641268207},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,11,13]],"date-time":"2008-11-13T00:00:00Z","timestamp":1226534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2010,9]]},"DOI":"10.1007\/s10479-008-0460-9","type":"journal-article","created":{"date-parts":[[2008,11,12]],"date-time":"2008-11-12T16:41:32Z","timestamp":1226508092000},"page":"35-56","source":"Crossref","is-referenced-by-count":10,"title":["New perspectives in VLSI design automation: deterministic packing by Sequence Pair"],"prefix":"10.1007","volume":"179","author":[{"given":"Adam","family":"Janiak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Kozik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maciej","family":"Lichtenstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,11,13]]},"reference":[{"issue":"6","key":"460_CR1","doi-asserted-by":"crossref","first-page":"1120","DOI":"10.1109\/TVLSI.2003.817546","volume":"11","author":"S. N. Adya","year":"2003","unstructured":"Adya, S. N., & Markov, I. L. (2003). Fixed-outline floorplanning: enabling hierarchical design. IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 11(6), 1120\u20131135.","journal-title":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems"},{"issue":"5","key":"460_CR2","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1145\/1044111.1044116","volume":"10","author":"S. N. Adya","year":"2005","unstructured":"Adya, S. N., & Markov, I. L. (2005). Combinatorial techniques for mixed-size placement. ACM Transactions on Design Automation of Electronic Systems, 10(5), 58\u201390.","journal-title":"ACM Transactions on Design Automation of Electronic Systems"},{"issue":"4","key":"460_CR3","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1137\/0209064","volume":"9","author":"B. S. Baker","year":"1980","unstructured":"Baker, B. S., Coifman, E. G., & Rivest, R. L. (1980). Orthogonal packings in two dimensions. SIAM Journal on Computing, 9(4), 846\u2013855.","journal-title":"SIAM Journal on Computing"},{"issue":"7","key":"460_CR4","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1109\/43.851988","volume":"19","author":"F. Balasa","year":"2000","unstructured":"Balasa, F., & Lampaert, K. (2000). Symmetry within the sequence-pair representation in the context of placement for analog design. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 19(7), 721\u2013731.","journal-title":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"},{"issue":"3","key":"460_CR5","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1145\/937503.937505","volume":"35","author":"C. Blum","year":"2003","unstructured":"Blum, C., & Roli, A. (2003). Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Computing Surveys, 35(3), 268\u2013308.","journal-title":"ACM Computing Surveys"},{"key":"460_CR6","unstructured":"Chan, H. H., & Markov, I. L. (2004). Practical slicing and nonslicing block-packing without simulated annealing. In Proc. Great Lakes Symp. on Very Large Scale Integration (VLSI) Systems (GLSVLSI), (pp. 282\u2013287) 2004."},{"key":"460_CR7","doi-asserted-by":"crossref","unstructured":"Chan, H. H., Adya, S. N., & Markov, I. L. (2005). Are floorplan representations useful in digital design? In Proc. ISPD (pp. 129\u2013136) 2005.","DOI":"10.1145\/1055137.1055164"},{"key":"460_CR8","doi-asserted-by":"crossref","unstructured":"Chang, Y.-C., Chang, Y.-W., Wu, G.-M., & Wu, S.-W. (2000). B*-trees: A new representation for non-slicing floorplans. In Proc. DAC (pp. 458\u2013463) 2000.","DOI":"10.1145\/337292.337541"},{"issue":"1","key":"460_CR9","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1109\/TCAD.2003.819896","volume":"23","author":"C. C. N. Chu","year":"2004","unstructured":"Chu, C. C. N., & Young, E. F. Y. (2004). Nonrectangular shaping and sizing of soft modules for floorplan-design improvement. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 23(1), 71\u201379.","journal-title":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"},{"key":"460_CR10","volume-title":"Introduction to algorithms","author":"T. Cormen","year":"1990","unstructured":"Cormen, T., Leiserson, C., & Rivest, R. (1990). Introduction to algorithms. New York: McGraw-Hill."},{"issue":"2","key":"460_CR11","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1109\/43.828551","volume":"19","author":"K. Fujiyoshi","year":"2000","unstructured":"Fujiyoshi, K., & Murata, H. (2000). Arbitrary convex and concave rectilinear block packing using sequence-pair. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 19(2), 224\u2013233.","journal-title":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"},{"key":"460_CR12","volume-title":"Computers and intractability; a guide to the theory of NP-completeness","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability; a guide to the theory of NP-completeness. New York: W.H. Freeman."},{"key":"460_CR13","doi-asserted-by":"crossref","unstructured":"Guo, P.-N., Cheng, C.-K., & Yoshimura, T. (1999). An O-Tree representation of non-slicing floorplan and its applications. In Proc. DAC (pp. 268\u2013273) 1999.","DOI":"10.1145\/309847.309928"},{"key":"460_CR14","doi-asserted-by":"crossref","unstructured":"Kahng, A. B. Classical floorplanning harmful? In Proc. ISPD (pp. 8\u201312) 2000.","DOI":"10.1145\/332357.332401"},{"key":"460_CR15","doi-asserted-by":"crossref","unstructured":"Kang, M. Z., & Dai, W. W.-M. (1998). Arbitrary rectilinear block packing based on sequence pair. In Proc. ICCAD (pp. 259\u2013266) 1998.","DOI":"10.1145\/288548.288623"},{"key":"460_CR16","volume-title":"The best of ICCAD\u201420 years of excellence in computer-aided design","author":"A. Kuehlmann","year":"2003","unstructured":"Kuehlmann, A. (2003). The best of ICCAD\u201420 years of excellence in computer-aided design. Dordrecht: Kluwer Academic."},{"key":"460_CR17","doi-asserted-by":"crossref","unstructured":"Lai, J.-B., Lin, M.-S., Wang, T.-C., & Wang, L.-C. (2001). Module placement with boundary constraints using the sequence-pair. In Proc. DAC (pp. 515\u2013520) 2001.","DOI":"10.1145\/370155.370522"},{"key":"460_CR18","doi-asserted-by":"crossref","unstructured":"Lin, J.-M., & Chang, Y.-W. (2001). TCG: a transitive closure graph based representation for non-slicing floorplans. In Proc. DAC (pp. 764\u2013769) 2001.","DOI":"10.1145\/378239.379062"},{"key":"460_CR19","doi-asserted-by":"crossref","unstructured":"Lin, J.-M., & Chang, Y.-W. (2002). TCG-S: orthogonal coupling of P*-admissible representations for general floorplans. In Proc. DAC (pp. 842\u2013847) 2002.","DOI":"10.1145\/513918.514127"},{"key":"460_CR20","doi-asserted-by":"crossref","unstructured":"Milenkovic, V. J. (1998). Rotational polygon containment and minimum enclosure. In Proceedings of the 14th annual symposium on computational geometry. ACM, 1998.","DOI":"10.1145\/276884.276885"},{"key":"460_CR21","doi-asserted-by":"crossref","unstructured":"Murata, H., & Kuh, E. S. (1998). Sequence-Pair based placement methods for hard\/soft\/pre-placed modules. In Proc. ISPD (pp. 167\u2013172) 1998.","DOI":"10.1145\/274535.274560"},{"key":"460_CR22","doi-asserted-by":"crossref","unstructured":"Murata, H., Fujiyoshi, K., Nakatake, S., & Kajitani, Y. (1995). Rectangle-packing based module placement. In Proc. ICCAD (pp. 472\u2013479) 1995.","DOI":"10.1109\/ICCAD.1995.480159"},{"key":"460_CR23","doi-asserted-by":"crossref","first-page":"1518","DOI":"10.1109\/43.552084","volume":"15","author":"H. Murata","year":"1996","unstructured":"Murata, H., Fujiyoshi, K., Nakatake, S., & Kajitani, Y. (1996). VLSI module placement based on rectangle-packing by the sequence pair. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 15, 1518\u20131524.","journal-title":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"},{"key":"460_CR24","doi-asserted-by":"crossref","unstructured":"Murata, H., Fujiyoshi, K., & Kaneko, M. (1997). VLSI\/PCB placement with obstacles based on sequence pair. In Proc. ISPD (pp. 26\u201331) 1997.","DOI":"10.1145\/267665.267675"},{"key":"460_CR25","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1109\/2.544235","volume":"11","author":"B. T. Murray","year":"1996","unstructured":"Murray, B. T., & Hayes, J. P. (1996). Testing ICs: getting to the core of the problem. IEEE Computer Magazine, 11, 32\u201338.","journal-title":"IEEE Computer Magazine"},{"key":"460_CR26","doi-asserted-by":"crossref","unstructured":"Nakatake, S., Fujiyoshi, K., Murata, H., & Kajitani, Y. (1996). Module placement on BSG-Structure and IC layout applications. In Proc. ICCAD (pp. 484\u2013491) 1996.","DOI":"10.1109\/ICCAD.1996.569870"},{"key":"460_CR27","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","volume":"11","author":"M. Nawaz","year":"1983","unstructured":"Nawaz, M., Enscore, E. E. Jr, & Ham, I. (1983). A heuristic algorithm for m-machine, n-job flow-shop sequencing problem. OMEGA International Journal of Management Science, 11, 91\u201395.","journal-title":"OMEGA International Journal of Management Science"},{"key":"460_CR28","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/S0377-2217(02)00644-6","volume":"152","author":"C. O\u011fuz","year":"2004","unstructured":"O\u011fuz, C., Zinder, Y., Do, V. H., Janiak, A., & Lichtenstein, M. (2004). Hybrid flow-shop scheduling problems with multiprocessor task systems. European Journal Operational Research, 152, 115\u2013131.","journal-title":"European Journal Operational Research"},{"key":"460_CR29","doi-asserted-by":"crossref","unstructured":"Pang, Y., Cheng, C.-K., & Yoshimura, T. (2000). An enhanced perturbing algorithm for floorplan design using the O-tree representation. In Proc. ISPD (pp. 168\u2013173) 2000.","DOI":"10.1145\/332357.332395"},{"key":"460_CR30","volume-title":"Combinatorial optimization: algorithms and complexity","author":"C. H. Papadimitriou","year":"1982","unstructured":"Papadimitriou, C. H., & Steiglitz, K. (1982). Combinatorial optimization: algorithms and complexity. New York: Prentice-Hall."},{"key":"460_CR31","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1145\/606603.606608","volume":"8","author":"M. A. Riepe","year":"2003","unstructured":"Riepe, M. A., & Sakallah, K. A. (2003). Transistor placement for noncomplementary digital VLSI cell synthesis. ACM Transactions on Design Automation of Electronic Systems, 8, 81\u2013107.","journal-title":"ACM Transactions on Design Automation of Electronic Systems"},{"key":"460_CR32","doi-asserted-by":"crossref","unstructured":"Roy, J. A., Lu, J. F., & Markov, I. L. (2006). Seeing the forest and the trees: steiner wirelength optimization in placement. In Proc. ISPD (pp. 78\u201385) 2006.","DOI":"10.1145\/1123008.1123024"},{"key":"460_CR33","unstructured":"Takahashi, T. (1996). An algorithm for finding a maximum-weight decreasing sequence in a permutation, motivated by rectangle packing problem (IEICE Tech. Rep. Very Large Scale Integration (VLSI) Systems Design Technol.), VLD96 (Vol. 7, pp. 31\u201335)."},{"issue":"12","key":"460_CR34","doi-asserted-by":"crossref","first-page":"1406","DOI":"10.1109\/43.969434","volume":"20","author":"X. Tang","year":"2001","unstructured":"Tang, X., Tian, R., & Wong, D. F. (2001). Fast evaluation of sequence pair in block placement by longest common subsequence computation. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 20(12), 1406\u20131413.","journal-title":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"},{"key":"460_CR35","doi-asserted-by":"crossref","unstructured":"Tang, X., & Wong, D. F. (2001). FAST-SP: a fast algorithm for block placement based on sequence pair. In Proc. DAC (pp. 521\u2013526) 2001.","DOI":"10.1145\/370155.370523"},{"key":"460_CR36","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1109\/43.752931","volume":"18","author":"J. Xu","year":"1999","unstructured":"Xu, J., Guo, P.-N., & Cheng, C.-K. (1999). Sequence-pair approach for rectilinear module placement. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 18, 484\u2013493.","journal-title":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-008-0460-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-008-0460-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-008-0460-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,21]],"date-time":"2023-05-21T01:18:52Z","timestamp":1684631932000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-008-0460-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,11,13]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,9]]}},"alternative-id":["460"],"URL":"https:\/\/doi.org\/10.1007\/s10479-008-0460-9","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,11,13]]}}}