{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:54:51Z","timestamp":1742939691425,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031791185"},{"type":"electronic","value":"9783031791192"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-79119-2_1","type":"book-chapter","created":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T21:38:29Z","timestamp":1738273109000},"page":"3-16","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Hybrid Method for\u00a0Linear Programming"],"prefix":"10.1007","author":[{"given":"Vitali","family":"Pirau","sequence":"first","affiliation":[]},{"given":"Roland","family":"Hildebrand","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,1,31]]},"reference":[{"issue":"2","key":"1_CR1","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1016\/j.cor.2010.07.001","volume":"38","author":"C Al-Najjar","year":"2011","unstructured":"Al-Najjar, C., Malakooti, B.: Hybrid-lp: Finding advanced starting points for simplex, and pivoting lp methods. Comput. Oper. Res. 38(2), 427\u2013434 (2011)","journal-title":"Comput. Oper. Res."},{"key":"1_CR2","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/BF01584074","volume":"1","author":"M B\u00e9nichou","year":"1971","unstructured":"B\u00e9nichou, M., Gauthier, J.M., Girodet, P., Hentges, G., Ribi\u00e8re, G., Vincent, O.: Experiments in mixed-integer linear programming. Math. Program. 1, 76\u201394 (1971)","journal-title":"Math. Program."},{"issue":"1","key":"1_CR3","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1287\/opre.50.1.42.17798","volume":"50","author":"GB Dantzig","year":"2002","unstructured":"Dantzig, G.B.: Linear programming. Oper. Res. 50(1), 42\u201347 (2002)","journal-title":"Oper. Res."},{"key":"1_CR4","unstructured":"Ficken, F.A.: The Simplex Method of Linear Programming. Courier Dover Publications (2015)"},{"key":"1_CR5","unstructured":"Ge, D., Wang, C., Xiong, Z., Ye, Y.: From an interior point to a corner point: smart crossover. arXiv preprint arXiv:2102.09420 (2021)"},{"issue":"3","key":"1_CR6","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1016\/j.ejor.2011.09.017","volume":"218","author":"J Gondzio","year":"2012","unstructured":"Gondzio, J.: Interior point methods 25 years later. Eur. J. Oper. Res. 218(3), 587\u2013601 (2012)","journal-title":"Eur. J. Oper. Res."},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Karmarkar, N.: A new polynomial-time algorithm for linear programming. In: Proceedings of the Sixteenth Annual ACM Symposium on Theory of Computing, pp. 302\u2013311 (1984)","DOI":"10.1145\/800057.808695"},{"issue":"2","key":"1_CR8","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1137\/S1052623495290209","volume":"8","author":"YE Nesterov","year":"1998","unstructured":"Nesterov, Y.E., Todd, M.J.: Primal-dual interior-point methods for self-scaled cones. SIAM J. Optim. 8(2), 324\u2013364 (1998)","journal-title":"SIAM J. Optim."},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Nesterov, Y., Nemirovskii, A.: Interior-point polynomial algorithms in convex programming. In: SIAM (1994)","DOI":"10.1137\/1.9781611970791"},{"issue":"9","key":"1_CR10","doi-asserted-by":"publisher","first-page":"1383","DOI":"10.1016\/S0305-0548(02)00077-1","volume":"30","author":"K Paparrizos","year":"2003","unstructured":"Paparrizos, K., Samaras, N., Stephanides, G.: A new efficient primal dual simplex algorithm. Comput. Oper. Res. 30(9), 1383\u20131399 (2003)","journal-title":"Comput. Oper. Res."},{"issue":"1\u20132","key":"1_CR11","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/S0377-0427(00)00433-7","volume":"124","author":"FA Potra","year":"2000","unstructured":"Potra, F.A., Wright, S.J.: Interior-point methods. J. Comput. Appl. Math. 124(1\u20132), 281\u2013302 (2000)","journal-title":"J. Comput. Appl. Math."},{"issue":"1","key":"1_CR12","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/BF01580724","volume":"40","author":"J Renegar","year":"1988","unstructured":"Renegar, J.: A polynomial-time algorithm, based on newton\u2019s method, for linear programming. Math. Program. 40(1), 59\u201393 (1988)","journal-title":"Math. Program."},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Renegar, J.: A mathematical view of interior-point methods in convex optimization. In: SIAM (2001)","DOI":"10.1137\/1.9780898718812"},{"issue":"1","key":"1_CR14","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/s10479-021-03980-x","volume":"330","author":"MG Tsionas","year":"2023","unstructured":"Tsionas, M.G., Philippas, D.: Measures of global sensitivity in linear programming: applications in banking sector. Ann. Oper. Res. 330(1), 585\u2013607 (2023)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"1_CR15","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/BF02592148","volume":"74","author":"SA Vavasis","year":"1996","unstructured":"Vavasis, S.A., Ye, Y.: A primal-dual interior point method whose running time depends only on the constraint matrix. Math. Program. 74(1), 79\u2013120 (1996)","journal-title":"Math. Program."}],"container-title":["Lecture Notes in Computer Science","Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-79119-2_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T21:38:33Z","timestamp":1738273113000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-79119-2_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031791185","9783031791192"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-79119-2_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"31 January 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"OPTIMA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Petrovac","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Montenegro","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"optima2024a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}