{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T14:12:55Z","timestamp":1763388775480},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642284892"},{"type":"electronic","value":"9783642284908"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-28490-8_34","type":"book-chapter","created":{"date-parts":[[2012,3,14]],"date-time":"2012-03-14T06:05:53Z","timestamp":1331705153000},"page":"321-330","source":"Crossref","is-referenced-by-count":3,"title":["DC Programming and DCA for Large-Scale Two-Dimensional Packing Problems"],"prefix":"10.1007","author":[{"given":"Babacar Mbaye","family":"Ndiaye","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Le Thi Hoai","family":"An","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pham Dinh","family":"Tao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi Shuai","family":"Niu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"34_CR1","first-page":"27","volume":"1","author":"M.A. Boschetti","year":"2003","unstructured":"Boschetti, M.A., Mingozzi, A.: The two-dimensional finite bin packing problem. Part I: New lower bounds for the oriented case. 4OR\u00a01, 27\u201342 (2003)","journal-title":"Part I: New lower bounds for the oriented case. 4OR"},{"key":"34_CR2","unstructured":"CPLEX Optimization ILOG, IncUsing the CPLEXR Callable Library and CPLEX Barrier and Mixed Integer Solver Options Version 11.0 (2007)"},{"key":"34_CR3","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/S0166-218X(01)00253-0","volume":"118","author":"M. Dell\u2019Amico","year":"2002","unstructured":"Dell\u2019Amico, M., Martello, S., Vigo, D.: A lower bound for the non-oriented two-dimensional bin packing problem. Discrete Appl. Math.\u00a0118, 13\u201324 (2002)","journal-title":"Discrete Appl. Math."},{"key":"34_CR4","first-page":"393","volume-title":"Annotated Bibliographies in Combinatorial Optimization","author":"H. Dyckhoff","year":"1997","unstructured":"Dyckhoff, H., Scheithauer, G., Terno, J.: Cutting and packing (C&P). In: Dell\u2019Amico, M., Maffioli, F., Martello, S. (eds.) Annotated Bibliographies in Combinatorial Optimization, pp. 393\u2013413. Wiley, Chichester (1997)"},{"key":"34_CR5","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/s101070100243","volume":"91","author":"S.P. Fekete","year":"2001","unstructured":"Fekete, S.P., Schepers, J.: New classes of lower bounds for the bin packing problem. Math. Programming\u00a091, 11\u201331 (2001)","journal-title":"Math. Programming"},{"key":"34_CR6","doi-asserted-by":"crossref","unstructured":"Gomory, R.E.: Solving Linear Programming Problems in Integer. In: Bellman, R.E., Hall Jr., M. (eds.) Combinatorial Analysis, pp. 211\u2013216. American Mathematical Society (1960)","DOI":"10.1090\/psapm\/010\/0114670"},{"key":"34_CR7","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1287\/opre.11.6.863","volume":"11","author":"P.C. Gilmore","year":"1963","unstructured":"Gilmore, P.C., Gomory, R.E.: A linear programming approach to the cutting stock problem - part II. Operations Research\u00a011, 863\u2013888 (1963)","journal-title":"Operations Research"},{"key":"34_CR8","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1287\/opre.13.1.94","volume":"13","author":"P.C. Gilmore","year":"1965","unstructured":"Gilmore, P.C., Gomory, R.E.: Multistage cutting problems of two and more dimensions. Oper. Res.\u00a013, 94\u2013119 (1965)","journal-title":"Oper. Res."},{"issue":"1","key":"34_CR9","first-page":"289","volume":"22","author":"H.A. Thi Le","year":"1997","unstructured":"Le Thi, H.A., Pham Dinh, T.: Convex analysis approach to d.c. programming: Theory, Algorithms and Applications. Acta Mathematica Vietnamica\u00a022(1), 289\u2013355 (1997)","journal-title":"Acta Mathematica Vietnamica"},{"key":"34_CR10","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10479-004-5022-1","volume":"133","author":"H.A. Thi Le","year":"2005","unstructured":"Le Thi, H.A., Pham Dinh, T.: The DC Programming and DCA revisited with DC models of real world nonconvex optimization problems. Annals of Operations Research\u00a0133, 23\u201346 (2005)","journal-title":"Annals of Operations Research"},{"key":"34_CR11","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1137\/S1052623494274313","volume":"8","author":"H.A. Thi Le","year":"1998","unstructured":"Le Thi, H.A., Pham Dinh, T.: DC optimization algorithms for solving the trust region subproblem. SIAM J. Optimisation\u00a08, 476\u2013505 (1998)","journal-title":"SIAM J. Optimisation"},{"issue":"2","key":"34_CR12","first-page":"169","volume":"27","author":"H.A. Thi Le","year":"1999","unstructured":"Le Thi, H.A., Pham Dinh, T., Le Dung, M.: Exact penalty in dc programming. Vietnam Journal of Mathematics\u00a027(2), 169\u2013178 (1999)","journal-title":"Vietnam Journal of Mathematics"},{"key":"34_CR13","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.: Two-dimensional packing problems: A survey. European Journal of Operational Research\u00a0141, 241\u2013252 (2002)","journal-title":"European Journal of Operational Research"},{"key":"34_CR14","first-page":"1","volume":"9953","author":"H. Marchand","year":"1999","unstructured":"Marchand, H., Martin, A., Weismantel, R., Wolsey, L.: Cutting Planes in integer and mixed integer programming. Core Discussion Paper\u00a09953, 1\u201350 (1999)","journal-title":"Core Discussion Paper"},{"key":"34_CR15","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1287\/mnsc.44.3.388","volume":"44","author":"S. Martello","year":"1998","unstructured":"Martello, S., Vigo, D.: Exact solution of the two-dimensional finite bin packing problem. Management Science\u00a044, 388\u2013399 (1998)","journal-title":"Management Science"},{"key":"34_CR16","series-title":"CCIS","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-540-87477-5_3","volume-title":"Modelling, Computation and Optimization in Information Systems and Management Sciences","author":"B.M. Ndiaye","year":"2008","unstructured":"Ndiaye, B.M., Pham Dinh, T., Le Thi, H.A.: DC programming and DCA for SSCRP. In: Modelling, Computation and Optimization in Information Systems and Management Sciences. CCIS, vol.\u00a014, pp. 21\u201330. Springer, Heidelberg (2008)"},{"key":"34_CR17","unstructured":"Nguyen, V.V.: Exact methods for polyhedral DC program with mixed 0-1 variables, based on DCA and New cutting planes. PhD Thesis, National Institute for Applied Sciences, Rouen (July 2006)"}],"container-title":["Lecture Notes in Computer Science","Intelligent Information and Database Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-28490-8_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T17:05:31Z","timestamp":1556471131000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28490-8_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642284892","9783642284908"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28490-8_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}