{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:18:09Z","timestamp":1759666689748},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,11,5]],"date-time":"2008-11-05T00:00:00Z","timestamp":1225843200000},"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-0462-7","type":"journal-article","created":{"date-parts":[[2008,11,4]],"date-time":"2008-11-04T02:21:54Z","timestamp":1225765314000},"page":"243-260","source":"Crossref","is-referenced-by-count":6,"title":["A novel non-linear approach to minimal area rectangular packing"],"prefix":"10.1007","volume":"179","author":[{"given":"Volker","family":"Maag","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Berger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anton","family":"Winterfeld","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Karl-Heinz","family":"K\u00fcfer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,11,5]]},"reference":[{"issue":"6","key":"462_CR1","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1109\/MDT.2005.150","volume":"22","author":"C. Ababei","year":"2005","unstructured":"Ababei, C., Feng, Y., Goplen, B., Mogal, H., Bazargan, K., Sapatnekar, S. S., & Zhang, T. (2005). Placement and routing in 3D integrated circuits. IEEE Design and Test of Computers, 22(6), 520\u2013531.","journal-title":"IEEE Design and Test of Computers"},{"key":"462_CR2","unstructured":"Ali, M., T\u00f6rn, A., & Viitanen, S. (1997). A direct search simulated annealing algorithm for optimization involving continuous variables (Technical Report TUCS-TR-97)."},{"issue":"3","key":"462_CR3","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1109\/43.3171","volume":"7","author":"A. Alon","year":"1988","unstructured":"Alon, A., & Ascher, U. (1988). Model and solution strategy for placement of rectangular blocks in the euclidean plane. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 7(3), 378\u2013386.","journal-title":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"},{"key":"462_CR4","unstructured":"Amossen, R. R., & Pisinger, D. (2006). Multi-dimensional bin packing problems with guillotine constraints. Computers and Operations Research."},{"issue":"2","key":"462_CR5","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/s10951-006-7187-8","volume":"9","author":"A. Anagnostopoulos","year":"2006","unstructured":"Anagnostopoulos, A., Michel, L., Hentenryck, P., & Vergados, Y. (2006). A simulated annealing approach to the traveling tournament problem. Journal of Scheduling, 9(2), 177\u2013193.","journal-title":"Journal of Scheduling"},{"key":"462_CR6","first-page":"196","volume-title":"Proceedings of the fifteenth annual SIAM symposium on discrete algorithms","author":"N. Bansal","year":"2004","unstructured":"Bansal, N., & Sviridenko, M. (2004). New approximability and inapproximability results for 2-dimensional bin packing. In Proceedings of the fifteenth annual SIAM symposium on discrete algorithms (pp. 196\u2013203). Philadelphia, PA, USA. Philadelphia: Society for Industrial and Applied Mathematics."},{"key":"462_CR7","volume-title":"Nonlinear programming: theory and algorithms","author":"M. Bazaraa","year":"1993","unstructured":"Bazaraa, M., Sherali, H. D., & Shetty, C. (1993). Nonlinear programming: theory and algorithms (2nd ed.). New York: Wiley.","edition":"2"},{"key":"462_CR8","unstructured":"Berger, M. (2006). Module placement in 2.5D system in package design automation. Master\u2019s thesis, University of Applied Sciences, Mittweida."},{"issue":"12","key":"462_CR9","doi-asserted-by":"crossref","first-page":"3535","DOI":"10.1016\/j.cor.2005.03.031","volume":"33","author":"E. G. Birgin","year":"2006","unstructured":"Birgin, E. G., Mart\u00ecnez, J. M., Nishihara, F. H., & Ronconi, D. P. (2006). Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization. Computers and Operations Research, 33(12), 3535\u20133548.","journal-title":"Computers and Operations Research"},{"issue":"3","key":"462_CR10","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":"462_CR11","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/s101079900111","volume":"A87","author":"J. V. Burke","year":"2000","unstructured":"Burke, J. V., & Xu, S. (2000). A non-interior predictor-corrector path-following algorithm for the monotone linear complementarity problem. Mathematical Programming, A87, 113\u2013130.","journal-title":"Mathematical Programming"},{"key":"462_CR12","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 Proceedings of the 37th conference on design automation (pp. 458\u2013463).","DOI":"10.1145\/337292.337541"},{"issue":"1","key":"462_CR13","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/PL00011375","volume":"88","author":"B. Chen","year":"2000","unstructured":"Chen, B., Chen, X., & Kanzow, C. (2000). A penalized Fischer-Burmeister NCP-function. Mathematical Programming, 88(1), 211\u2013216.","journal-title":"Mathematical Programming"},{"issue":"4","key":"462_CR14","doi-asserted-by":"crossref","first-page":"1168","DOI":"10.1137\/0614081","volume":"14","author":"B. Chen","year":"1993","unstructured":"Chen, B., & Harker, P. T. (1993). A non-interior-point continuation method for linear complementarity problems. SIAM Journal on Matrix Analysis and Applications, 14(4), 1168\u20131190.","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"issue":"3","key":"462_CR15","doi-asserted-by":"crossref","first-page":"944","DOI":"10.1016\/j.cor.2006.05.012","volume":"35","author":"F. Clautiaux","year":"2008","unstructured":"Clautiaux, F., Jouglet, A., Carlier, J., & Moukrim, A. (2008). A new constraint programming approach for the orthogonal packing problem. Computers and Operations Research, 35(3), 944\u2013959.","journal-title":"Computers and Operations Research"},{"key":"462_CR16","first-page":"46","volume-title":"Approximation algorithms for NP-hard problems","author":"E. G. Coffman","year":"1996","unstructured":"Coffman, E. G., Garey, M. R., & Johnson, D. S. (1996). Approximation algorithms for bin packing: A survey. In D. Hochbaum (Ed.), Approximation algorithms for NP-hard problems (pp. 46\u201393). Boston: PWS Publishing."},{"issue":"2","key":"462_CR17","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1080\/03052159508941259","volume":"25","author":"M. C. Dorneich","year":"1995","unstructured":"Dorneich, M. C., & Sahinidis, N. V. (1995). Global optimization algorithms for chip layout and compaction. Engineering Optimization, 25(2), 131\u2013154.","journal-title":"Engineering Optimization"},{"issue":"2","key":"462_CR18","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s10288-004-0037-7","volume":"2","author":"G. Fasano","year":"2004","unstructured":"Fasano, G. (2004). A MIP approach for some practical packing problems: Balancing constraints and tetris-like items. 4OR: A Quarterly Journal of Operations Research, 2(2), 161\u2013174.","journal-title":"4OR: A Quarterly Journal of Operations Research"},{"key":"462_CR19","unstructured":"Goetschalckx, M., & Irohara, T. (2007). Efficient formulations for the multi-floor facility layout problem with elevators. Optimization Online."},{"key":"462_CR20","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 Proceedings of the 1999 design automation conference (pp. 268\u2013273).","DOI":"10.1145\/309847.309928"},{"key":"462_CR21","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1145\/74382.74445","volume-title":"DAC \u201989: Proceedings of the 26th ACM\/IEEE conference on design automation","author":"A. Herrigel","year":"1989","unstructured":"Herrigel, A., & Fichtner, W. (1989). An analytic optimization technique for placement of macro-cells. In DAC \u201989: Proceedings of the 26th ACM\/IEEE conference on design automation (pp. 376\u2013381). New York, NY, USA. New York: ACM Press."},{"key":"462_CR22","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03199-5","volume-title":"Global optimization: deterministic approaches","author":"R. Horst","year":"1996","unstructured":"Horst, R., & Tuy, H. (1996). Global optimization: deterministic approaches (3rd ed.). Heidelberg: Springer.","edition":"3"},{"key":"462_CR23","doi-asserted-by":"crossref","unstructured":"Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983). Optimization by simulated annealing. Science, 220(4598).","DOI":"10.1126\/science.220.4598.671"},{"issue":"1","key":"462_CR24","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0377-2217(97)00420-7","volume":"113","author":"M. Kolonko","year":"1999","unstructured":"Kolonko, M. (1999). Some new results on simulated annealing applied to the job shop scheduling problem. European Journal of Operational Research, 113(1), 123\u2013136.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"462_CR25","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1137\/0906002","volume":"6","author":"A. V. Levy","year":"1985","unstructured":"Levy, A. V., & Montalvo, A. (1985). The tunneling algorithm for the global minimization of functions. SIAM Journal on Scientific and Statistical Computing, 6(1), 15\u201329.","journal-title":"SIAM Journal on Scientific and Statistical Computing"},{"key":"462_CR26","doi-asserted-by":"crossref","unstructured":"Lin, J. M., & Chang, Y.-W. (2001). TCG: A transitive closure graph-based representation for non-slicing floorplans. In Proceedings of the 2001 design automation conference (pp. 764\u2013769).","DOI":"10.1145\/378239.379062"},{"key":"462_CR27","volume-title":"Linear and nonlinear programming","author":"D. G. Luenberger","year":"1989","unstructured":"Luenberger, D. G. (1989). Linear and nonlinear programming. Reading: Addison-Wesley."},{"key":"462_CR28","unstructured":"Moffitt, M. D., & Pollack, M. E. (2006). Optimal rectangle packing: A Meta-CSP approach. In Proceedings of the 16th international conference on automated planning and scheduling."},{"issue":"12","key":"462_CR29","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(12), 1518\u20131524.","journal-title":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"},{"issue":"3","key":"462_CR30","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1287\/ijoc.1060.0192","volume":"19","author":"D. Pisinger","year":"2007","unstructured":"Pisinger, D. (2007). Denser packings obtained in O(n log log n) time. INFORMS Journal of Computing, 19(3), 395\u2013405.","journal-title":"INFORMS Journal of Computing"},{"key":"462_CR31","volume-title":"Handbook of constraint programming","author":"F. Rossi","year":"2006","unstructured":"Rossi, F., van Beek, P., & Walsh, T. (2006). Handbook of constraint programming. Amsterdam: Elsevier B.V."},{"key":"462_CR32","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-9164-5","volume-title":"Bi-level strategies in semi-infinite programming","author":"O. Stein","year":"2003","unstructured":"Stein, O. (2003). Bi-level strategies in semi-infinite programming. Boston: Kluwer."},{"key":"462_CR33","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1023\/A:1008669226453","volume":"13","author":"D. Sun","year":"1999","unstructured":"Sun, D., & Qi, L. (1999). On NCP-functions. Computational Optimization and Applications, 13, 201\u2013220.","journal-title":"Computational Optimization and Applications"},{"key":"462_CR34","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1145\/370155.370523","volume-title":"Proceedings of the 2001 Asia and South Pacific design automation conference","author":"X. Tang","year":"2001","unstructured":"Tang, X., Tian, R., & Wong, D. F. (2001). FAST-SP: A fast algorithm for block placement based on sequence pair. In Proceedings of the 2001 Asia and South Pacific design automation conference (pp. 521\u2013526). New York: ACM Press."},{"issue":"2","key":"462_CR35","doi-asserted-by":"crossref","first-page":"1015","DOI":"10.1016\/j.cam.2006.09.006","volume":"206","author":"Y.-J. Wang","year":"2007","unstructured":"Wang, Y.-J., & Zhang, J.-S. (2007). An efficient algorithm for large scale global optimization of continuous functions. Journal of Computational and Applied Mathematics, 206(2), 1015\u20131026.","journal-title":"Journal of Computational and Applied Mathematics"},{"key":"462_CR36","unstructured":"Winterfeld, A. (2007). Large-scale semi-infinite optimization applied to industrial gemstone cutting. PhD thesis, University of Kaiserslautern."},{"key":"462_CR37","first-page":"101","volume-title":"DAC \u201986: Proceedings of the 23rd ACM\/IEEE conference on design automation","author":"D. F. Wong","year":"1986","unstructured":"Wong, D. F., & Liu, C. L. (1986). A new algorithm for floorplan design. In DAC \u201986: Proceedings of the 23rd ACM\/IEEE conference on design automation (pp. 101\u2013107). Piscataway, NJ, USA. New York: IEEE Press."},{"key":"462_CR38","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971453","volume-title":"Primal-dual interior-point methods","author":"S. J. Wright","year":"1997","unstructured":"Wright, S. J. (1997). Primal-dual interior-point methods. Philadelphia: SIAM."},{"issue":"1","key":"462_CR39","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1145\/606603.606607","volume":"8","author":"B. Yao","year":"2003","unstructured":"Yao, B., Chen, H., Cheng, C.-K., & Graham, R. L. (2003). Floorplan representations: Complexity and connections. ACM Transactions on Design of Automated Electronic Systems, 8(1), 55\u201380.","journal-title":"ACM Transactions on Design of Automated Electronic Systems"},{"key":"462_CR40","doi-asserted-by":"crossref","DOI":"10.1002\/9781118032701","volume-title":"Interior point algorithms, theory and analysis","author":"Y. Ye","year":"1997","unstructured":"Ye, Y. (1997). Interior point algorithms, theory and analysis. New York: Wiley."},{"key":"462_CR41","doi-asserted-by":"crossref","first-page":"771","DOI":"10.1145\/1118299.1118477","volume-title":"Proceedings of the 2006 conference on Asia South Pacific design automation","author":"Y. Zhan","year":"2006","unstructured":"Zhan, Y., Feng, Y., & Sapatnekar, S. S. (2006). A fixed-die floorplanning algorithm using an analytical approach. In Proceedings of the 2006 conference on Asia South Pacific design automation (pp. 771\u2013776). New York, NY, USA. New York: ACM Press."},{"issue":"10","key":"462_CR42","doi-asserted-by":"crossref","first-page":"1312","DOI":"10.1287\/mnsc.31.10.1312","volume":"31","author":"J. Z. Zhang","year":"1985","unstructured":"Zhang, J. Z., & Kim, N. H. (1985). An improved successive linear programming algorithm. Management Science, 31(10), 1312\u20131331.","journal-title":"Management Science"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-008-0462-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-008-0462-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-008-0462-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:07:51Z","timestamp":1559153271000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-008-0462-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,11,5]]},"references-count":42,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,9]]}},"alternative-id":["462"],"URL":"https:\/\/doi.org\/10.1007\/s10479-008-0462-7","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,11,5]]}}}