{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:00:22Z","timestamp":1740099622466,"version":"3.37.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030406158"},{"type":"electronic","value":"9783030406165"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-40616-5_28","type":"book-chapter","created":{"date-parts":[[2020,2,13]],"date-time":"2020-02-13T11:02:59Z","timestamp":1581591779000},"page":"337-345","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Grossone Methodology for Lexicographic Mixed-Integer Linear Programming Problems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7020-1524","authenticated-orcid":false,"given":"Marco","family":"Cococcioni","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6794-6691","authenticated-orcid":false,"given":"Alessandro","family":"Cudazzo","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0258-724X","authenticated-orcid":false,"given":"Massimo","family":"Pappalardo","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1429-069X","authenticated-orcid":false,"given":"Yaroslav D.","family":"Sergeyev","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,2,14]]},"reference":[{"key":"28_CR1","unstructured":"Cococcioni, M., Cudazzo, A., Pappalardo, M., Sergeyev, Y.D.: Solving the lexicographic mixed-integer linear programming problem using branch-and-bound and Grossone methodology. Comm. Nonlinear Sci. Numer. Simul., Submitted"},{"key":"28_CR2","first-page":"298","volume":"318","author":"M Cococcioni","year":"2018","unstructured":"Cococcioni, M., Pappalardo, M., Sergeyev, Y.D.: Lexicographic multi-objective linear programming using grossone methodology: theory and algorithm. Appl. Math. Comput. 318, 298\u2013311 (2018)","journal-title":"Appl. Math. Comput."},{"key":"28_CR3","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/s10589-017-9957-y","volume":"71","author":"R Leone De","year":"2018","unstructured":"De Leone, R., Fasano, G., Sergeyev, Y.D.: Planar methods and grossone for the conjugate gradient breakdown in nonlinear programming. Comput. Optim. Appl. 71, 73\u201393 (2018)","journal-title":"Comput. Optim. Appl."},{"key":"28_CR4","unstructured":"Fiaschi, L., Cococcioni, M.: Non-archimedean game theory: a numerical approach. Submitted"},{"key":"28_CR5","first-page":"1","volume":"14","author":"L Fiaschi","year":"2018","unstructured":"Fiaschi, L., Cococcioni, M.: Numerical asymptotic results in game theory using Sergeyev\u2019s infinity computing. Int. J. Unconventional Comput. 14, 1\u201325 (2018)","journal-title":"Int. J. Unconventional Comput."},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"Fiaschi, L., Cococcioni, M.: Generalizing pure and impure iterated prisoner\u2019s dilemmas to the case of infinite and infinitesimal quantities. In: Proceedings of the 3rd International Conference on \u201cNumerical Computations: Theory and Algorithms\u201d. Springer Lecture Notes in Computer Science (2019)","DOI":"10.1007\/978-3-030-40616-5_32"},{"key":"28_CR7","first-page":"312","volume":"318","author":"M Gaudioso","year":"2018","unstructured":"Gaudioso, M., Giallombardo, G., Mukhametzhanov, M.S.: Numerical infinitesimals in a variable metric method for convex nonsmooth optimization. Appl. Math. Comput. 318, 312\u2013320 (2018)","journal-title":"Appl. Math. Comput."},{"key":"28_CR8","unstructured":"Lai, L., Fiaschi, L., Cococcioni, M.: Solving mixed pareto-lexicographic multi-objective optimization problems: the case of priority chains. Submitted"},{"key":"28_CR9","first-page":"3","volume":"255","author":"G Lolli","year":"2015","unstructured":"Lolli, G.: Metamathematical investigations on the theory of grossone. Appl. Math. Comput. 255, 3\u201314 (2015)","journal-title":"Appl. Math. Comput."},{"key":"28_CR10","unstructured":"Sergeyev, Y.D.: Arithmetic of Infinity, 2nd edn. (2013). Orizz, Merid., CS (ed.)"},{"issue":"4","key":"28_CR11","doi-asserted-by":"crossref","first-page":"567","DOI":"10.15388\/Informatica.2008.231","volume":"19","author":"YD Sergeyev","year":"2008","unstructured":"Sergeyev, Y.D.: A new applied approach for executing computations with infinite and infinitesimal quantities. Informatica 19(4), 567\u2013596 (2008)","journal-title":"Informatica"},{"issue":"3\u20134","key":"28_CR12","doi-asserted-by":"publisher","first-page":"1701","DOI":"10.1016\/j.na.2009.09.009","volume":"72","author":"YD Sergeyev","year":"2010","unstructured":"Sergeyev, Y.D.: Counting systems and the First Hilbert problem. Nonlinear Anal. Ser. A Theory Methods Appl. 72(3\u20134), 1701\u20131708 (2010)","journal-title":"Nonlinear Anal. Ser. A Theory Methods Appl."},{"issue":"2","key":"28_CR13","first-page":"95","volume":"68","author":"YD Sergeyev","year":"2010","unstructured":"Sergeyev, Y.D.: Lagrange lecture: methodology of numerical computations with infinities and infinitesimals. Rend. del Seminario Matematico dell\u2019Universit\u00e0 e del Politecnico di Torino 68(2), 95\u2013113 (2010)","journal-title":"Rend. del Seminario Matematico dell\u2019Universit\u00e0 e del Politecnico di Torino"},{"key":"28_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21819-9","volume-title":"Unconventional Computation and Natural Computation","year":"2015","unstructured":"Calude, C.S., Dinneen, M.J. (eds.): UCNC 2015. LNCS, vol. 9252. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21819-9"},{"key":"28_CR15","doi-asserted-by":"publisher","first-page":"219","DOI":"10.4171\/EMSS\/4-2-3","volume":"4","author":"YD Sergeyev","year":"2017","unstructured":"Sergeyev, Y.D.: Numerical infinities and infinitesimals: methodology, applications, and repercussions on two Hilbert problems. EMS Surv. Math. Sci. 4, 219\u2013320 (2017)","journal-title":"EMS Surv. Math. Sci."},{"key":"28_CR16","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/j.cnsns.2017.11.013","volume":"59","author":"YD Sergeyev","year":"2018","unstructured":"Sergeyev, Y.D., Kvasov, D.E., Mukhametzhanov, M.S.: On strong homogeneity of a class of global optimization algorithms working with infinite and infinitesimal scales. Comm. Nonlinear Sci. Numer. Simul. 59, 319\u2013330 (2018)","journal-title":"Comm. Nonlinear Sci. Numer. Simul."}],"container-title":["Lecture Notes in Computer Science","Numerical Computations: Theory and Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-40616-5_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,27]],"date-time":"2021-02-27T08:23:32Z","timestamp":1614414212000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-40616-5_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030406158","9783030406165"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-40616-5_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"14 February 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NUMTA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Numerical Computations: Theory and Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Crotone","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"numta2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/si.deis.unical.it\/~yaro\/numta2019\/index.php","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}