{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,4]],"date-time":"2025-09-04T13:47:34Z","timestamp":1756993654498},"publisher-location":"Berlin, Heidelberg","reference-count":61,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540782940"},{"type":"electronic","value":"9783540782957"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-78295-7_7","type":"book-chapter","created":{"date-parts":[[2008,8,11]],"date-time":"2008-08-11T13:20:59Z","timestamp":1218460859000},"page":"185-219","source":"Crossref","is-referenced-by-count":9,"title":["Hybrid Metaheuristics for Packing Problems"],"prefix":"10.1007","author":[{"given":"Toshihide","family":"Ibaraki","sequence":"first","affiliation":[]},{"given":"Shinji","family":"Imahori","sequence":"additional","affiliation":[]},{"given":"Mutsunori","family":"Yagiura","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1_1","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0010-4485(76)90006-3","volume":"8","author":"M Adamowicz","year":"1976","unstructured":"Adamowicz M, Albano A (1976) Nesting two-dimensional shapes in rectangular modules, Computer-Aided Design 8:27-33","journal-title":"Computer-Aided Design"},{"key":"7_CR2_1","first-page":"227","volume":"7","author":"PK Agarwal","year":"2000","unstructured":"Agarwal PK, Guibas LJ, Har-Peled S, Rabinovitch A, Sharir M (2000) Penetration depth of two convex polytopes in 3D, Nordic Journal of Computing 7:227\u2013240","journal-title":"Nordic Journal of Computing"},{"key":"7_CR3_1","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1109\/TSMC.1980.4308483","volume":"10","author":"A Albano","year":"1980","unstructured":"Albano A, Sapuppo G (1980) Optimal allocation of two-dimensional irregular shapes using heuristic search methods, IEEE Transactions on Systems, Man and Cybernetics 10:242\u2013248","journal-title":"IEEE Transactions on Systems, Man and Cybernetics"},{"key":"7_CR4_1","unstructured":"Art Jr. RC (1966) An approach to the two-dimensional irregular cutting stock problem, Technical Report 36-Y08, IBM Cambridge Science Center"},{"key":"7_CR5_1","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1016\/S0010-4485(00)00112-3","volume":"33","author":"AR Babu","year":"2001","unstructured":"Babu AR, Babu NR (2001) A genetic approach for nesting of 2-D parts in 2-D sheets using genetic and heuristic algorithms, Computer-Aided Design 33:879\u2013891","journal-title":"Computer-Aided Design"},{"key":"7_CR6_1","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1137\/0209064","volume":"9","author":"BS Baker","year":"1980","unstructured":"Baker BS, Coffman Jr. EG, Rivest RL (1980) Orthogonal packing in two dimensions, SIAM Journal on Computing 9:846\u2013855","journal-title":"SIAM Journal on Computing"},{"key":"7_CR7_1","unstructured":"Beltr\u00e1n JD, Calder\u00f3n JE, Cabrera RJ, P\u00e9rez JAM, Moreno-Vega JM (2004) GRASP\/VNS hybrid for the strip packing problem, In: Proceedings of the First International Workshop on Hybrid Meta-heuristics (HM04), 79\u201390"},{"key":"7_CR8_1","volume-title":"Incorporating problem specific knowledge into a local search framework for the irregular shape packing problem","author":"JA Bennell","year":"1998","unstructured":"Bennell JA (1998) Incorporating problem specific knowledge into a local search framework for the irregular shape packing problem, Ph.D. thesis, European Business Management School, University of Wales, Swansea"},{"key":"7_CR9_1","doi-asserted-by":"publisher","first-page":"4259","DOI":"10.1080\/002075499189763","volume":"37","author":"JA Bennell","year":"1999","unstructured":"Bennell JA, Dowsland KA (1999) A tabu thresholding implementation for the irregular stock cutting problem, International Journal of Production Research 37:4259\u20134275","journal-title":"International Journal of Production Research"},{"key":"7_CR10_1","doi-asserted-by":"publisher","first-page":"1160","DOI":"10.1287\/mnsc.47.8.1160.10230","volume":"47","author":"JA Bennell","year":"2001","unstructured":"Bennell JA, Dowsland KA (2001) Hybridising tabu search with optimisation techniques for irregular stock cutting, Management Science 47:1160\u20131172","journal-title":"Management Science"},{"key":"7_CR11_1","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/S0305-0548(00)00021-6","volume":"28","author":"JA Bennell","year":"2001","unstructured":"Bennell JA, Dowsland KA, Dowsland WB (2001) The irregular cutting-stock problem\u2014a new procedure for deriving the no-fit polygon, Computers & Operations Research 28:271\u2013287","journal-title":"Computers & Operations Research"},{"key":"7_CR12_1","unstructured":"Bertsekas DP (1999) Nonlinear Programming (2nd edition), Athena Scientific."},{"key":"7_CR13_1","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/BF02022998","volume":"41","author":"J B\u0142a\u017cewicz","year":"1993","unstructured":"B\u0142a\u017cewicz J, Hawryluk P, Walkowiak R (1993) Using a tabu search for solving the two-dimensional irregular cutting problem, Annals of Operations Research 41:313\u2013325","journal-title":"Annals of Operations Research"},{"key":"7_CR14_1","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1287\/opre.1060.0293","volume":"54","author":"E Burke","year":"2006","unstructured":"Burke E, Hellier R, Kendall G, Whitwell G (2006) A new bottom-left-fill heuristic algorithm for the two-dimensional irregular packing problem, Operations Research 54:587\u2013601","journal-title":"Operations Research"},{"key":"7_CR15_1","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1287\/opre.1040.0109","volume":"52","author":"EK Burke","year":"2004","unstructured":"Burke EK, Kendall G, Whitwell G (2004) A new placement heuristic for the orthogonal stock-cutting problem, Operations Research 52: 655\u2013671","journal-title":"Operations Research"},{"key":"7_CR16_1","doi-asserted-by":"crossref","unstructured":"Chang YC, Chang YW, Wu GM, Wu SW (2000) B*-trees: a new representation for non-slicing floorplans, In: Proceedings of the 37th Design Automation Conference, 458\u2013463","DOI":"10.1145\/337292.337541"},{"key":"7_CR17_1","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1109\/TCAD.2003.819896","volume":"23","author":"CCN Chu","year":"2004","unstructured":"Chu CCN, Young EFY (2004) Nonrectangular shaping and sizing of soft modules for floorplan-design improvement, IEEE Transactions Computer Aided Design of Integrated Circuits and Systems 23:71\u201379","journal-title":"IEEE Transactions Computer Aided Design of Integrated Circuits and Systems"},{"key":"7_CR18_1","doi-asserted-by":"crossref","first-page":"801","DOI":"10.1137\/0209062","volume":"9","author":"EG Coffman Jr.","year":"1980","unstructured":"Coffman Jr. EG, Garey MR, Johnson DS, Tarjan RE (1980) Performance bounds for level-oriented two-dimensional packing algorithms, SIAM Journal on Computing 9:801\u2013826","journal-title":"SIAM Journal on Computing"},{"key":"7_CR19_1","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1007\/BF01190153","volume":"9","author":"D Dobkin","year":"1993","unstructured":"Dobkin D, Hershberger J, Kirkpatrick D, Suri S (1993) Computing the intersection-depth of polyhedra, Algorithmica 9:518\u2013533","journal-title":"Algorithmica"},{"key":"7_CR20_1","unstructured":"Dr\u00e9o J, P\u00e9trowski JDA, Siarry P, Taillard E (2006) Metaheuristics for Hard Optimization, Springer."},{"key":"7_CR21_1","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0377-2217(90)90350-K","volume":"44","author":"H Dyckhoff","year":"1990","unstructured":"Dyckhoff H (1990) A typology of cutting and packing problems, European Journal of Operational Research 44:145\u2013159","journal-title":"European Journal of Operational Research"},{"key":"7_CR22_1","doi-asserted-by":"publisher","first-page":"1249","DOI":"10.1016\/j.ejor.2005.11.063","volume":"183","author":"J Egeblad","year":"2007","unstructured":"Egeblad J, Nielsen BK, Odgaard A (2007) Fast neighborhood search for two- and three-dimensional nesting problems, European Journal of Operational Research 183:1249\u20131266","journal-title":"European Journal of Operational Research"},{"key":"7_CR23_1","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1287\/ijoc.7.4.426","volume":"7","author":"F Glover","year":"1995","unstructured":"Glover F (1995) Tabu thresholding: Improved search by nonmonotonic trajectories, ORSA Journal on Computing 7:426\u2013442","journal-title":"ORSA Journal on Computing"},{"key":"7_CR24_1","doi-asserted-by":"crossref","unstructured":"Glover FW, Kochenberge GA (eds) (2003) Handbook of Metaheuristics, Springer.","DOI":"10.1007\/b101874"},{"key":"7_CR25_1","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/S0377-2217(02)00130-3","volume":"141","author":"AM Gomes","year":"2002","unstructured":"Gomes AM, Oliveira JF (2002) A 2-exchange heuristic for nesting problems, European Journal of Operational Research 141:359\u2013370","journal-title":"European Journal of Operational Research"},{"key":"7_CR26_1","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1016\/j.ejor.2004.09.008","volume":"171","author":"AM Gomes","year":"2006","unstructured":"Gomes AM, Oliveira JF (2006) Solving irregular strip packing problems by hybridising simulated annealing and linear programming, European Journal of Operational Research 171:811\u2013829","journal-title":"European Journal of Operational Research"},{"key":"7_CR27_1","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1109\/43.908471","volume":"20","author":"PN Guo","year":"2001","unstructured":"Guo PN, Takahashi T, Cheng CK, Yoshimura T (2001) Floorplanning using a tree representation, IEEE Transactions on Computer Aided Design of Integrated Circuits and Systems 20:281\u2013289","journal-title":"IEEE Transactions on Computer Aided Design of Integrated Circuits and Systems"},{"key":"7_CR28_1","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/BF02099693","volume":"57","author":"R Heckmann","year":"1995","unstructured":"Heckmann R, Lengauer T (1995) A simulated annealing approach to the nesting problem in the textile manufacturing industry, Annals of Operations Research 57:103\u2013133","journal-title":"Annals of Operations Research"},{"key":"7_CR29_1","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/S0377-2217(99)00357-4","volume":"128","author":"E Hopper","year":"2001","unstructured":"Hopper E, Turton BCH (2001) An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem, European Journal of Operational Research 128:34\u201357","journal-title":"European Journal of Operational Research"},{"key":"7_CR30_1","doi-asserted-by":"crossref","unstructured":"Ibaraki T, Nakamura K (2006) Packing problems with soft rectangles, In: Almeida F, Blesa Aguilera MJ, Blum C, Vega JMM, P\u00e9rez MP, Roli A, Sampels M (eds) Hybrid Metaheuristics, Springer Lecture Notes on Computer Science 4030:13\u201327","DOI":"10.1007\/11890584_2"},{"key":"7_CR31_1","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/s10107-003-0427-1","volume":"97","author":"S Imahori","year":"2003","unstructured":"Imahori S, Yagiura M, Ibaraki T (2003) Local search algorithms for the rectangle packing problem with general spatial costs, Mathematical Programming 97:543\u2013569","journal-title":"Mathematical Programming"},{"key":"7_CR32_1","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/j.ejor.2004.02.020","volume":"167","author":"S Imahori","year":"2005","unstructured":"Imahori S, Yagiura M, Ibaraki T (2005) Improved local search algorithms for the rectangle packing problem with general spatial costs, European Journal of Operational Research 167:48\u201367","journal-title":"European Journal of Operational Research"},{"key":"7_CR33_1","unstructured":"Imahori S, Yagiura M, Ibaraki T (2005) Variable neighborhood search for the rectangle packing problem, In: Proceedings of the 6th Metaheuristics International Conference (MIC05), 532\u2013537"},{"key":"#cr-split#-7_CR34_1.1","unstructured":"Imamichi T, Yagiura M, Nagamochi H (2006) An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem, Technical Report 2007-009, Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University, February, 2007 (available at http:\/\/www.amp.i.kyoto-u.ac.jp\/tecrep\/;"},{"key":"#cr-split#-7_CR34_1.2","unstructured":"A short version is available in: Proceedings of the Third International Symposium on Scheduling (ISS06), 132???137"},{"key":"7_CR35_1","doi-asserted-by":"crossref","unstructured":"Itoga H, Kodama C, Fujiyoshi K (2005) A graph based soft module handling in floorplan, IEICE Transactions Fundamentals E88-A:3390\u20133397","DOI":"10.1093\/ietfec\/e88-a.12.3390"},{"key":"7_CR36_1","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/BFb0032050","volume":"443","author":"DS Johnson","year":"1990","unstructured":"Johnson DS (1990) Local optimization and the traveling salesman problem, In: Peterson MS (ed) Automata, Languages and Programming, Lecture Notes in Computer Science 443:446\u2013461","journal-title":"Languages and Programming, Lecture Notes in Computer Science"},{"key":"7_CR37_1","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1287\/moor.25.4.645.12118","volume":"25","author":"C Kenyon","year":"2000","unstructured":"Kenyon C, R\u00e9mila E (2000) A near-optimal solution to a two-dimensional cutting stock problem, Mathematics of Operations Research 25:645\u2013656","journal-title":"Mathematics of Operations Research"},{"key":"7_CR38_1","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1109\/TVCG.2004.1260767","volume":"10","author":"YJ Kim","year":"2004","unstructured":"Kim YJ, Lin MC, Manocha D (2004) Incremental penetration depth estimation between convex polytopes using dual-space expansion, IEEE Transactions on Visualization and Computer Graphics 10:152\u2013163","journal-title":"IEEE Transactions on Visualization and Computer Graphics"},{"key":"7_CR39_1","doi-asserted-by":"crossref","unstructured":"Konno H, Kuno T (1995) Multiplicative programming problems, In: Horst R, Pardalos PM (eds) Handbook of Global Optimization, Kluwer Academic Publishers, 369\u2013406","DOI":"10.1007\/978-1-4615-2025-2_8"},{"key":"7_CR40_1","unstructured":"Kurebe Y, Miwa H, Ibaraki T (2007) Weighted module placement based on rectangle packing, 4th ESICUP meeting (EURO Special Interest Group on Cutting and Packing)."},{"key":"7_CR41_1","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1016\/0377-2217(95)00021-H","volume":"84","author":"Z Li","year":"1995","unstructured":"Li Z, Milenkovic V (1995) Compaction and separation algorithms for non-convex polygons and their applications, European Journal of Operational Research 84:539\u2013561","journal-title":"European Journal of Operational Research"},{"key":"7_CR42_1","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/S0377-2217(02)00123-6","volume":"141","author":"A Lodi","year":"2002","unstructured":"Lodi A, Martello S, Monaci M (2002) Two-dimensional packing problems: A survey, European Journal of Operational Research 141:241\u2013252","journal-title":"European Journal of Operational Research"},{"key":"7_CR43_1","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1287\/ijoc.11.4.345","volume":"11","author":"A Lodi","year":"1999","unstructured":"Lodi A, Martello S, Vigo D (1999) Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems, INFORMS Journal on Computing 11:345\u2013357","journal-title":"INFORMS Journal on Computing"},{"key":"7_CR44_1","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/S0925-7721(98)00012-1","volume":"10","author":"VJ Milenkovic","year":"1998","unstructured":"Milenkovic VJ (1998) Rotational polygon overlap minimization and compaction, Computational Geometry 10:305\u2013318","journal-title":"Computational Geometry"},{"key":"7_CR45_1","doi-asserted-by":"publisher","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 15:1518\u20131524","journal-title":"IEEE Transactions on Computer Aided Design"},{"key":"7_CR46_1","doi-asserted-by":"crossref","unstructured":"Murata H, Kuh ES (1998) Sequence-pair based placement method for hard\/soft\/preplaced modules, In: Proceedings of International Symposium on Physical Design, 167\u2013172","DOI":"10.1145\/274535.274560"},{"key":"7_CR47_1","doi-asserted-by":"publisher","first-page":"1165","DOI":"10.1142\/S0129054106004327","volume":"17","author":"H Nagamochi","year":"2005","unstructured":"Nagamochi H (2005) Packing soft rectangles, International Journal of Foundations of Computer Science 17:1165\u20131178","journal-title":"International Journal of Foundations of Computer Science"},{"key":"7_CR48_1","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1109\/43.703832","volume":"17","author":"S Nakatake","year":"1998","unstructured":"Nakatake S, Fujiyoshi K, Murata H, Kajitani Y (1998) Module packing based on the BSG-structure and IC layout applications, IEEE Transactions on Computer Aided Design of Integrated Circuits and Systems 17:519\u2013530","journal-title":"IEEE Transactions on Computer Aided Design of Integrated Circuits and Systems"},{"key":"7_CR49_1","doi-asserted-by":"crossref","unstructured":"Nesterov Y, Nemirovskii A (1994) Interior Point Polynomial Algorithms in Convex Programming, SIAM Pub.","DOI":"10.1137\/1.9781611970791"},{"key":"7_CR50_1","doi-asserted-by":"crossref","first-page":"145","DOI":"10.15807\/jorsj.45.145","volume":"45","author":"H Okano","year":"2002","unstructured":"Okano H (2002) A scanline-based algorithm for the 2D free-form bin packing problem, Journal of the Operations Research Society of Japan 45:145\u2013161","journal-title":"Journal of the Operations Research Society of Japan"},{"key":"7_CR51_1","doi-asserted-by":"crossref","unstructured":"Oliveira JF, Ferreira JS (1993) Algorithms for nesting problems, In: Vidal RVV (ed) Applied Simulated Annealing. Lecture Notes in Economics and Mathematical Systems 396, Springer-Verlag, 255\u2013274","DOI":"10.1007\/978-3-642-46787-5_13"},{"key":"7_CR52_1","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s002910050105","volume":"22","author":"JF Oliveira","year":"2000","unstructured":"Oliveira JF, Gomes AM, Ferreira JS (2000) TOPOS\u2014a new constructive algorithm for nesting problems, OR Spektrum 22:263\u2013284","journal-title":"OR Spektrum"},{"key":"7_CR53_1","doi-asserted-by":"crossref","unstructured":"Preas BT, van Cleemput WM (1979) Placement algorithms for arbitrarily shaped blocks, In: Proceedings of the ACM\/IEEE Design Automation Conference, 474\u2013480","DOI":"10.1109\/DAC.1979.1600152"},{"key":"7_CR54_1","doi-asserted-by":"crossref","unstructured":"Ramkumar GD (1996) An algorithm to compute the Minkowski sum outer-face of two simple polygons, In: Proceedings of the Twelfth Annual Symposium on Computational Geometry (SCG96), 234\u2013241","DOI":"10.1145\/237218.237374"},{"key":"7_CR55_1","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0377-2217(95)00038-0","volume":"92","author":"YG Stoyan","year":"1996","unstructured":"Stoyan YG, Novozhilova MV, Kartashov AV (1996) Mathematical model and method of searching for a local extremum for the non-convex oriented polygons allocation problem, European Journal of Operational Research 92:193\u2013210","journal-title":"European Journal of Operational Research"},{"key":"7_CR56_1","unstructured":"Takahashi T (1996) An algorithm for finding a maximum-weight decreasing sequence in a permutation, motivated by rectangle packing problem (in Japanese), Technical Report of IEICE VLD96-30, 31\u201335"},{"key":"7_CR57_1","doi-asserted-by":"publisher","first-page":"1406","DOI":"10.1109\/43.969434","volume":"20","author":"X Tang","year":"2001","unstructured":"Tang X, Tian R, Wong DF (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:1406\u20131413","journal-title":"IEEE Transactions on Computer Aided Design of Integrated Circuits and Systems"},{"key":"7_CR58_1","unstructured":"Umetani S, Yagiura M, Imamichi T, Imahori S, Nonobe K, Ibaraki T (2006) A guided local search algorithm based on a fast neighborhood search for the irregular strip packing problem, In: Proceedings of the Third International Symposium on Scheduling (ISS06), 126\u2013131"},{"key":"7_CR59_1","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1016\/j.ejor.2005.12.047","volume":"183","author":"G W\u00e4scher","year":"2007","unstructured":"W\u00e4scher G, Hau\u00dfner H, Schumann H (2007) An improved typology of cutting and packing problems, European Journal of Operational Research 183:1109\u20131130","journal-title":"European Journal of Operational Research"},{"key":"7_CR60_1","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1109\/43.920707","volume":"20","author":"FY Young","year":"2001","unstructured":"Young FY, Chu CCN, Luk WL, Wong YC (2001) Handling soft modules in general nonslicing floorplan using Lagrangean relaxation, IEEE Transactions on Computer-Aided Design of Integrated Circuit and Systems 20: 687\u2013692","journal-title":"IEEE Transactions on Computer-Aided Design of Integrated Circuit and Systems"}],"container-title":["Studies in Computational Intelligence","Hybrid Metaheuristics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78295-7_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:14:02Z","timestamp":1606184042000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78295-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540782940","9783540782957"],"references-count":61,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78295-7_7","relation":{},"ISSN":["1860-949X"],"issn-type":[{"type":"print","value":"1860-949X"}],"subject":[],"published":{"date-parts":[[2008]]}}}