{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:45:44Z","timestamp":1725551144032},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540294986"},{"type":"electronic","value":"9783540322450"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11571155_8","type":"book-chapter","created":{"date-parts":[[2005,10,31]],"date-time":"2005-10-31T07:32:31Z","timestamp":1130743951000},"page":"70-81","source":"Crossref","is-referenced-by-count":4,"title":["On Improved Least Flexibility First Heuristics Superior for Packing and Stock Cutting Problems"],"prefix":"10.1007","author":[{"given":"Yu-Liang","family":"Wu","sequence":"first","affiliation":[]},{"given":"Chi-Kong","family":"Chan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1137\/0209064","volume":"9","author":"B.S. Baker","year":"1980","unstructured":"Baker, B.S., Coffman Jr., E.G., Rivest, R.L.: Orthogonal Packing in two dimensions. SIAM Journal on Computing\u00a09, 846\u2013855 (1980)","journal-title":"SIAM Journal on Computing"},{"issue":"9","key":"8_CR2","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1145\/361002.361007","volume":"18","author":"J.L. Bentley","year":"1975","unstructured":"Bentley, J.L.: Multidimensional binary search trees used for associative searching. Communication of ACM\u00a018(9), 507\u2013517 (1975)","journal-title":"Communication of ACM"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Kenyon, C., Remila, E.: Approximate strip packing. In: Proc. 37th IEEE Symposium on Foundations of Computer Science, pp. 31\u201336 (1996)","DOI":"10.1109\/SFCS.1996.548461"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Kenyon, C., Remila, E.: A near optimal solution to a two-dimensional cutting stock problem. Mathematics of Operations Research\u00a025(4) (2000)","DOI":"10.1287\/moor.25.4.645.12118"},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1016\/0377-2217(93)90195-S","volume":"68","author":"K. Dowsland","year":"1993","unstructured":"Dowsland, K.: Some experiments with simulated annealing techniques for packing problems. European Journal of Operational Research\u00a068, 389\u2013399 (1993)","journal-title":"European Journal of Operational Research"},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0377-2217(94)00166-9","volume":"88","author":"S. Jacobs","year":"1996","unstructured":"Jacobs, S.: On Genetic algorithms for the packing of polygons. European Journal of Operational Research\u00a088, 165\u2013181 (1996)","journal-title":"European Journal of Operational Research"},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1016\/S0377-2217(02)00218-7","volume":"145","author":"T.W. Leung","year":"2003","unstructured":"Leung, T.W., Chan, C.K., Troutt, M.D.: Mixed simulated annealing-Genetic algorithm Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem. European Journal of Operational Research\u00a0145, 530\u2013542 (2003)","journal-title":"European Journal of Operational Research"},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1016\/S0377-2217(02)00129-7","volume":"141","author":"Y.L. Wu","year":"2002","unstructured":"Wu, Y.L., Huang, W.Q., Lau, S.C., Wong, C.K., Young, G.H.: An effective quasi-human heuristic for solving the rectangle packing problem. European Journal of Operational Research\u00a0141, 341\u2013358 (2002)","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"8_CR9","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1109\/43.673633","volume":"17","author":"H. Murata","year":"1998","unstructured":"Murata, H., Fujiyoshi, K., Kaneko, M.: VLSI\/PCB placement with obstacles based on sequence pair. IEEE Transactions on Computer-aided Design of Integrated Circuits and Systems\u00a017(1), 60\u201367 (1998)","journal-title":"IEEE Transactions on Computer-aided Design of Integrated Circuits and Systems"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Burke, E., Kendall, G.: Applying Simulated Annealing and the No Fit Polygon to the Nesting Problem. In: Proceedings of the World Manufacturing Congress, Durham, UK, pp. 27\u201330 (1999)","DOI":"10.1007\/3-540-46695-9_38"},{"issue":"3","key":"8_CR11","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1023\/A:1018517106992","volume":"8","author":"C.H. Dagli","year":"1997","unstructured":"Dagli, C.H., Poshyanonder, P.: New Approaches to Nesting Rectangular Patterns. Journal of Intelligent Manufacturing\u00a08(3), 177\u2013190 (1997)","journal-title":"Journal of Intelligent Manufacturing"},{"key":"8_CR12","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1109\/TC.1983.1676307","volume":"32\/8","author":"B. Chazzelle","year":"1983","unstructured":"Chazzelle, B.: The Bottom-Left Bin Packing Heuristic: An efficient Implementation. IEEE\u00a0Transactions on Computers\u00a032\/8, 697\u2013707 (1983)","journal-title":"IEEE\u00a0Transactions on Computers"},{"key":"8_CR13","first-page":"34","volume":"128\/1","author":"E. Hopper","year":"2000","unstructured":"Hopper, E., Turton, B.C.H.: An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem. European Journal of Operational Research\u00a0128\/1, 34\u201357 (2000)","journal-title":"European Journal of Operational Research"},{"key":"8_CR14","first-page":"383","volume-title":"Proceedings for Artificial Neural Networks in Engineering Conference","author":"K. Ratanapan","year":"1997","unstructured":"Ratanapan, K., Dagli, C.H.: An object-based evolutionary algorithm for solving irregular nesting problems. In: Proceedings for Artificial Neural Networks in Engineering Conference, vol.\u00a07, pp. 383\u2013388. ASME Press, New York (1997)"},{"key":"8_CR15","first-page":"581","volume-title":"Proceedings of the International Conference on Evolutionary Computation 1998, ICEC 1998","author":"K. Ratanapan","year":"1998","unstructured":"Ratanapan, K., Dagli, C.H.: An object-based evolutionary algorithm: the nesting solution. In: Proceedings of the International Conference on Evolutionary Computation 1998, ICEC 1998, pp. 581\u2013586. IEEE, Piscataway (1998)"},{"key":"8_CR16","first-page":"412","volume":"112","author":"D. Liu","year":"1999","unstructured":"Liu, D., Teng, H.: An Improved BL-algorithm for Genetic Algorithm of the Orthogonal. Packing of Rectangles. European Journal of Operational Research\u00a0112, 412\u2013420 (1999)","journal-title":"Packing of Rectangles. European Journal of Operational Research"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Zhou, S., Dong, S., Hong, X., Cai, Y., Cheng, C.K., Gu, J.: ECBL, An Extended Corner BlockList with solution Space including Optimum Placement. In: Proceeding of International Symposium on Physical Design, pp. 156\u2013161 (2001)","DOI":"10.1145\/369691.369756"},{"key":"8_CR18","unstructured":"Zhuang, C., Saknushi, K., Jin, L., Kajitani, Y.: An Enhanced Q-Sequence Augmented with Empty-Room-Insertion and Parenthesis Trees. In: Proceedings of Design, Automation and Test in Europe, pp. 61\u201368 (2002)"},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"Tang, X., Wong, D.F.: FAST-SP: A Fast Algorithm for Block Placement based on Sequence Pair. In: Proceeding of IEEE Asia South Pacific Design Automation Conference, pp. 521\u2013526 (2001)","DOI":"10.1145\/370155.370523"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Lin, J.-M., Chang, Y.-W.: TCG: A Transitive Closure Graph-Based Representation for Non-Slicing Floorplans. In: Proceedings of the 38th ACM\/IEEE Design Automation Conference, pp. 764\u2013769 (2001)","DOI":"10.1145\/378239.379062"},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"Wong, D.F., Liu, C.L.: Anew algorithm for floorplanning design. In: DAC 1986, pp. 101\u2013107 (1986)","DOI":"10.1109\/DAC.1986.1586075"},{"key":"8_CR22","doi-asserted-by":"crossref","unstructured":"Lin, J.-M., Chang, Y.-W.: TCG-S: orthogonal coupling of P*-admissable representation for general floorplans. In: DAC 2002, pp. 764\u2013769 (2002)","DOI":"10.1145\/513918.514127"},{"key":"8_CR23","unstructured":"Zhou, H., Wang, J.: ACG- adjacent constraint graph for general floorplans. In: ICCD 2004, pp. 572\u2013575 (2004)"},{"key":"8_CR24","doi-asserted-by":"crossref","unstructured":"Wang, P., Cheng, C.K., Yoshimura, T.: An enhanced perturbing algorithm for floorplan design using the O-tree representation. In: ISPD 2000, pp. 168\u2013173 (2000)","DOI":"10.1145\/332357.332395"},{"key":"8_CR25","doi-asserted-by":"crossref","unstructured":"Chang, Y.C., Chang, Y.W., Wu, E.M., Wu, S.W.: B*-trees: a new representation for non-slicing floorplans. In: DAC 2000, pp. 458\u2013463 (2000)","DOI":"10.1145\/337292.337541"},{"issue":"4","key":"8_CR26","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1109\/TCAD.2003.809651","volume":"22","author":"E.F.Y. Young","year":"2003","unstructured":"Young, E.F.Y., Chu, C.C.N., Sgen, Z.C.: Twin binary sequences: a non-redundant, representation for general non-slciing floorplan. IEEE Transaction on CAD\u00a022(4), 457\u2013469 (2003)","journal-title":"IEEE Transaction on CAD"},{"key":"8_CR27","doi-asserted-by":"crossref","unstructured":"Chan, H.H., Markov, I.L.: Practical slicing and non-slicing block-packing without simulated annealing. In: IEEE Great Lake Symp. On VLSI 2004, pp. 282\u2013287 (2004)","DOI":"10.1145\/988952.989020"}],"container-title":["Lecture Notes in Computer Science","Stochastic Algorithms: Foundations and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11571155_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,5]],"date-time":"2023-05-05T07:14:47Z","timestamp":1683270887000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11571155_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540294986","9783540322450"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/11571155_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}