{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T05:27:02Z","timestamp":1742966822314,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319986531"},{"type":"electronic","value":"9783319986548"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-99639-4_16","type":"book-chapter","created":{"date-parts":[[2018,8,22]],"date-time":"2018-08-22T15:43:34Z","timestamp":1534952614000},"page":"230-237","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Finding Multiple Solutions in Nonlinear Integer Programming with Algebraic Test-Sets"],"prefix":"10.1007","author":[{"given":"M. I.","family":"Hartillo","sequence":"first","affiliation":[]},{"given":"J. M.","family":"Jim\u00e9nez-Cobano","sequence":"additional","affiliation":[]},{"given":"J. M.","family":"Ucha","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,23]]},"reference":[{"key":"16_CR1","unstructured":"Sahinidis, N. V.: BARON 14.4.0: Global Optimization of Mixed-Integer Nonlinear Programs. User\u2019s Manual (2014)"},{"issue":"7","key":"16_CR2","doi-asserted-by":"publisher","first-page":"999","DOI":"10.1287\/mnsc.46.7.999.12033","volume":"46","author":"D Bertsimas","year":"2000","unstructured":"Bertsimas, D., Perakis, G., Tayur, S.: A new algebraic geometry algorithm for integer programming. Manag. Sci. 46(7), 999\u20131008 (2000)","journal-title":"Manag. Sci."},{"issue":"3","key":"16_CR3","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1016\/j.ejor.2010.11.007","volume":"210","author":"FJ Castro","year":"2011","unstructured":"Castro, F.J., Gago, J., Hartillo, I., Puerto, J., Ucha, J.M.: An algebraic approach to integer portfolio problems. Eur. J. Oper. Res. 210(3), 647\u2013659 (2011)","journal-title":"Eur. J. Oper. Res."},{"key":"16_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/3-540-54522-0_102","volume-title":"Applied Algebra, Algebraic Algorithms and Error-Correcting Codes","author":"P Conti","year":"1991","unstructured":"Conti, P., Traverso, C.: Buchberger algorithm and integer programming. In: Mattson, H.F., Mora, T., Rao, T.R.N. (eds.) AAECC 1991. LNCS, vol. 539, pp. 130\u2013139. Springer, Heidelberg (1991). \n                    https:\/\/doi.org\/10.1007\/3-540-54522-0_102"},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"1947","DOI":"10.1016\/j.ejor.2005.10.053","volume":"176","author":"M Corazza","year":"2007","unstructured":"Corazza, M., Favaretto, D.: On the existence of solutions to the quadratic mixed-integer mean-variance portfolio selection problem. Eur. J. Oper. Res. 176, 1947\u20131960 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"16_CR6","unstructured":"Belotti, P.: COUENNE: a user\u2019s manual. Department of Mathematics Sciences, Clemson University. \n                    https:\/\/www.coin-or.org\/Couenne\/"},{"key":"16_CR7","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-6911-1","volume-title":"Using Algebraic Geometry","author":"DA Cox","year":"2005","unstructured":"Cox, D.A., Little, J., O\u2019Shea, D.: Using Algebraic Geometry. Graduate Texts in Mathematics, vol. 185, 2nd edn. Springer, Hiedelberg (2005). \n                    https:\/\/doi.org\/10.1007\/978-1-4757-6911-1","edition":"2"},{"key":"16_CR8","first-page":"247","volume":"118","author":"M Djerdjour","year":"2001","unstructured":"Djerdjour, M., Rekab, K.: A branch and bound algorithm for designing reliable systems at a minimum cost. Appl. Math. Comput. 118, 247\u201359 (2001)","journal-title":"Appl. Math. Comput."},{"key":"16_CR9","unstructured":"4ti2 team: 4ti2 - a software package for algebraic, geometric and combinatorial problems on linear spaces (2013). \n                    https:\/\/www.4ti2.de"},{"issue":"11","key":"16_CR10","doi-asserted-by":"publisher","first-page":"2752","DOI":"10.1016\/j.cor.2013.05.019","volume":"40","author":"J Gago","year":"2013","unstructured":"Gago, J., Hartillo, I., Puerto, J., Ucha, J.M.: Exact cost minimization of a series-parallel reliable system with multiple component choices using an algebraic method. Comput. Oper. Res. 40(11), 2752\u20132759 (2013)","journal-title":"Comput. Oper. Res."},{"key":"16_CR11","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.cor.2014.03.008","volume":"49","author":"AAS Le\u00e3o","year":"2014","unstructured":"Le\u00e3o, A.A.S., Cherri, L.H., Arenales, M.N.: Determining the K-best solutions of knapsack problems. Comput. Oper. Res. 49, 71\u201382 (2014)","journal-title":"Comput. Oper. Res."},{"key":"16_CR12","first-page":"77","volume":"7","author":"H Markowitz","year":"1952","unstructured":"Markowitz, H.: Portfolio selection. J. Finance 7, 77\u201391 (1952)","journal-title":"J. Finance"},{"key":"16_CR13","first-page":"732","volume":"181","author":"N Ruan","year":"2006","unstructured":"Ruan, N., Sun, X.L.: An exact algorithm for cost minimization in series reliability systems with multiple component choices. Appl. Math. Comput. 181, 732\u201341 (2006)","journal-title":"Appl. Math. Comput."},{"issue":"3","key":"16_CR14","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/BF01585566","volume":"69","author":"SR Tayur","year":"1995","unstructured":"Tayur, S.R., Thomas, R.R., Natraj, N.R.: An algebraic geometry algorithm for scheduling in presence of setups and correlated demands. Math. Program. Ser. A 69(3), 369\u2013401 (1995). \n                    https:\/\/doi.org\/10.1007\/BF01585566","journal-title":"Math. Program. Ser. A"},{"issue":"2","key":"16_CR15","doi-asserted-by":"publisher","first-page":"802","DOI":"10.1016\/j.ejor.2006.11.024","volume":"184","author":"J-F Tsai","year":"2008","unstructured":"Tsai, J.-F., Lin, M.-H., Hu, Y.-C.: Finding multiple solutions to general integer linear programs. Eur. J. Oper. Res. 184(2), 802\u2013809 (2008)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"16_CR16","doi-asserted-by":"publisher","first-page":"882","DOI":"10.1016\/j.ejor.2007.02.010","volume":"186","author":"H-L Li","year":"2008","unstructured":"Li, H.-L., Tsai, J.-F.: A distributed computation algorithm for solving portfolio problems with integer variables. Eur. J. Oper. Res. 186(2), 882\u2013891 (2008)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-99639-4_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,9,2]],"date-time":"2018-09-02T20:38:36Z","timestamp":1535920716000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-99639-4_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319986531","9783319986548"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-99639-4_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}