{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T01:04:58Z","timestamp":1775005498700,"version":"3.50.1"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032157904","type":"print"},{"value":"9783032157911","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-15791-1_12","type":"book-chapter","created":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:02:23Z","timestamp":1775001743000},"page":"167-184","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An $$\\varepsilon $$-Constraint Method for\u00a0the\u00a0Bi-objective Efficient 2-Terminal Reliability Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1750-1368","authenticated-orcid":false,"given":"Yuri","family":"Ogorodnikov","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9276-4128","authenticated-orcid":false,"given":"Daniil","family":"Khachai","sequence":"additional","affiliation":[]},{"given":"Roman","family":"Rudakov","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3555-0080","authenticated-orcid":false,"given":"Michael","family":"Khachay","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,4,1]]},"reference":[{"issue":"2","key":"12_CR1","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/s13675-017-0090-6","volume":"6","author":"C Artigues","year":"2018","unstructured":"Artigues, C., Jozefowiez, N., Sarpong, B.M.: Column generation algorithms for bi-objective combinatorial optimization problems with a min\u2013max objective. EURO J. Comput. Optim. 6(2), 117\u2013142 (2018). https:\/\/doi.org\/10.1007\/s13675-017-0090-6","journal-title":"EURO J. Comput. Optim."},{"key":"12_CR2","series-title":"Cambridge Studies in Advanced Mathematics","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814068","volume-title":"Random Graphs","author":"B Bollob\u00e1s","year":"2001","unstructured":"Bollob\u00e1s, B.: Random Graphs. Cambridge Studies in Advanced Mathematics, vol. 73, 2nd edn. Cambridge University Press, Cambridge (2001)","edition":"2"},{"key":"12_CR3","doi-asserted-by":"publisher","unstructured":"Bouchery, Y., Corbett, C., Fransoo, J., Tan, T. (eds.): Sustainable Supply Chains: A Research-Based Textbook on Operations and Strategy. Springer Series in Supply Chain Management. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-45565-0","DOI":"10.1007\/978-3-031-45565-0"},{"key":"12_CR4","doi-asserted-by":"publisher","unstructured":"Ca\u00f1as, H., Mula, J., Campuzano-Bolarin, F.: Strategical and tactical supply chain optimisation for smart production planning and control 4.0. Int. J. Prod. Res. 1\u201321 (2024). https:\/\/doi.org\/10.1080\/00207543.2024.2412828","DOI":"10.1080\/00207543.2024.2412828"},{"key":"12_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2020.105191","volume":"128","author":"M Casazza","year":"2021","unstructured":"Casazza, M., Ceselli, A.: Optimization algorithms for resilient path selection in networks. Comput. Oper. Res. 128, 105191 (2021). https:\/\/doi.org\/10.1016\/j.cor.2020.105191","journal-title":"Comput. Oper. Res."},{"key":"12_CR6","doi-asserted-by":"publisher","unstructured":"Cheng, J., Lisser, A.: Maximum probability shortest path problem. Discret. Appl. Math. 192, 40\u201348 (2015). https:\/\/doi.org\/10.1016\/j.dam.2014.05.009, 11th Cologne\/Twente Workshop on Graphs and Combinatorial Optimization (CTW 2012)","DOI":"10.1016\/j.dam.2014.05.009"},{"key":"12_CR7","unstructured":"Desrosiers, J., L\u00fcbbecke, M., Desaulniers, G., Gauthier, J.B.: Branch-and-price. Les Cahiers du GERAD, GERAD (2024)"},{"key":"12_CR8","doi-asserted-by":"publisher","unstructured":"Dolgui, A., Ivanov, D.: Internet of behaviors: conceptual model, practical and theoretical implications for supply chain and operations management. Int. J. Prod. Res. 63(1), 1\u20138 (2025). https:\/\/doi.org\/10.1080\/00207543.2024.2372008","DOI":"10.1080\/00207543.2024.2372008"},{"issue":"5","key":"12_CR9","doi-asserted-by":"publisher","first-page":"1285","DOI":"10.1080\/00207543.2019.1627438","volume":"58","author":"A Dolgui","year":"2020","unstructured":"Dolgui, A., Ivanov, D., Rozhkov, D.: Does the ripple effect influence the bullwhip effect? An integrated analysis of structural and operational dynamics in the supply chain. Int. J. Prod. Res. 58(5), 1285\u20131301 (2020). https:\/\/doi.org\/10.1080\/00207543.2019.1627438","journal-title":"Int. J. Prod. Res."},{"issue":"9","key":"12_CR10","doi-asserted-by":"publisher","first-page":"2674","DOI":"10.1016\/j.cor.2005.10.003","volume":"34","author":"M Ehrgott","year":"2007","unstructured":"Ehrgott, M., Gandibleux, X.: Bound sets for biobjective combinatorial optimization problems. Comput. Oper. Res. 34(9), 2674\u20132694 (2007). https:\/\/doi.org\/10.1016\/j.cor.2005.10.003","journal-title":"Comput. Oper. Res."},{"key":"12_CR11","doi-asserted-by":"publisher","unstructured":"Feng, W., Guo, H.: An FPRAS for Two Terminal Reliability in Directed Acyclic Graphs. Leibniz International Proceedings in Informatics (LIPIcs), vol. 297, pp. 62:1\u201362:19. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2024). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2024.62. https:\/\/drops.dagstuhl.de\/entities\/document\/10.4230\/LIPIcs.ICALP.2024.62","DOI":"10.4230\/LIPIcs.ICALP.2024.62"},{"key":"12_CR12","unstructured":"Gurobi Optimization, L.: Gurobi optimizer reference manual (2024). https:\/\/www.gurobi.com\/documentation\/9.5\/refman\/index.html"},{"key":"12_CR13","doi-asserted-by":"publisher","unstructured":"Joseph Geunes, P.M.P.: Supply Chain Optimization. Springer, New York (2005). https:\/\/doi.org\/10.1007\/b137269","DOI":"10.1007\/b137269"},{"key":"12_CR14","doi-asserted-by":"publisher","unstructured":"Katoozian, H., Zanjani, M.K.: Supply network design for mass personalization in industry 4.0 era. Int. J. Prod. Econ. 244, 108349 (2022). https:\/\/doi.org\/10.1016\/j.ijpe.2021.108349","DOI":"10.1016\/j.ijpe.2021.108349"},{"key":"12_CR15","doi-asserted-by":"publisher","unstructured":"Khachai, D., Batta\u00efa, O., Petunin, A., Khachay, M.: Discrete cutting path problems: a general solution framework and industrial applications. Int. J. Prod. Res. 63(3), 949\u2013969 (2025). https:\/\/doi.org\/10.1080\/00207543.2024.2365360","DOI":"10.1080\/00207543.2024.2365360"},{"issue":"2","key":"12_CR16","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1016\/j.ejor.2023.01.039","volume":"309","author":"D Khachai","year":"2023","unstructured":"Khachai, D., Sadykov, R., Battaia, O., Khachay, M.: Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm. Eur. J. Oper. Res. 309(2), 488\u2013505 (2023). https:\/\/doi.org\/10.1016\/j.ejor.2023.01.039","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"12_CR17","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1016\/j.amc.2009.03.037","volume":"213","author":"G Mavrotas","year":"2009","unstructured":"Mavrotas, G.: Effective implementation of the $$\\varepsilon $$-constraint method in multi-objective mathematical programming problems. Appl. Math. Comput. 213(2), 455\u2013465 (2009). https:\/\/doi.org\/10.1016\/j.amc.2009.03.037","journal-title":"Appl. Math. Comput."},{"issue":"18","key":"12_CR18","doi-asserted-by":"publisher","first-page":"9652","DOI":"10.1016\/j.amc.2013.03.002","volume":"219","author":"G Mavrotas","year":"2013","unstructured":"Mavrotas, G., Florios, K.: An improved version of the augmented epsilon-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems. Appl. Math. Comput. 219(18), 9652\u20139669 (2013). https:\/\/doi.org\/10.1016\/j.amc.2013.03.002","journal-title":"Appl. Math. Comput."},{"issue":"3","key":"12_CR19","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0016-0032(56)90559-2","volume":"262","author":"E Moore","year":"1956","unstructured":"Moore, E., Shannon, C.: Reliable circuits using less reliable relays. J. Franklin Inst. 262(3), 191\u2013208 (1956). https:\/\/doi.org\/10.1016\/0016-0032(56)90559-2","journal-title":"J. Franklin Inst."},{"issue":"6","key":"12_CR20","doi-asserted-by":"publisher","first-page":"1193","DOI":"10.1134\/S0965542524700441","volume":"64","author":"Y Ogorodnikov","year":"2024","unstructured":"Ogorodnikov, Y., Rudakov, R., Khachai, D., Khachai, M.: Fault-tolerant families of production plans: mathematical model, computational complexity, and branch-and-bound algorithms. Comput. Math. Math. Phys. 64(6), 1193\u20131210 (2024). https:\/\/doi.org\/10.1134\/S0965542524700441","journal-title":"Comput. Math. Math. Phys."},{"key":"12_CR21","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1016\/j.ifacol.2022.09.455","volume":"55","author":"Y Ogorodnikov","year":"2022","unstructured":"Ogorodnikov, Y., Rudakov, R., Khachai, D., Khachay, M.: A problem-specific branch-and-bound algorithm for the protected shortest simple path problem with must-pass nodes. IFAC-PapersOnLine 55, 572\u2013577 (2022). https:\/\/doi.org\/10.1016\/j.ifacol.2022.09.455","journal-title":"IFAC-PapersOnLine"},{"issue":"3","key":"12_CR22","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1002\/net.21866","volume":"73","author":"M Redmond","year":"2019","unstructured":"Redmond, M., Campbell, A.M., Ehmke, J.F.: The most reliable flight itinerary problem. Networks 73(3), 325\u2013343 (2019). https:\/\/doi.org\/10.1002\/net.21866","journal-title":"Networks"},{"issue":"4","key":"12_CR23","doi-asserted-by":"publisher","first-page":"818","DOI":"10.1137\/0214057","volume":"14","author":"A Satyanarayana","year":"1985","unstructured":"Satyanarayana, A., Wood, R.K.: A linear-time algorithm for computing k-terminal reliability in series-parallel networks. SIAM J. Comput. 14(4), 818\u2013832 (1985). https:\/\/doi.org\/10.1137\/0214057","journal-title":"SIAM J. Comput."},{"issue":"2","key":"12_CR24","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1108\/IJLM-12-2019-0333","volume":"32","author":"B Sundarakani","year":"2021","unstructured":"Sundarakani, B., Pereira, V., Ishizaka, A.: Robust facility location decisions for resilient sustainable supply chain performance in the face of disruptions. Int. J. Logist. Manage. 32(2), 357\u2013385 (2021). https:\/\/doi.org\/10.1108\/IJLM-12-2019-0333","journal-title":"Int. J. Logist. Manage."},{"key":"12_CR25","doi-asserted-by":"publisher","unstructured":"Tanguy, C.: Exact two-terminal reliability of some directed networks. In: 2007 6th International Workshop on Design and Reliable Communication Networks, pp. 1\u20138 (2007). https:\/\/doi.org\/10.1109\/DRCN.2007.4762273","DOI":"10.1109\/DRCN.2007.4762273"},{"key":"12_CR26","doi-asserted-by":"publisher","unstructured":"Tanguy, C.: What is the probability of connecting two points? In: Journal of Physics A: Mathematical and Theoretical, vol. 40, no. 47, 14099 (2007). https:\/\/doi.org\/10.1088\/1751-8113\/40\/47\/005","DOI":"10.1088\/1751-8113\/40\/47\/005"},{"key":"12_CR27","unstructured":"Uchoa, E., Pessoa, A., Moreno, L.: Optimizing with Column Generation: Advanced branch-cut-and-price algorithms (Part I). Technical report. L-2024-3, Cadernos do LOGIS-UFF, Universidade Federal Fluminense, Engenharia de Produ\u00e7\u00e3o (2024)"},{"issue":"3","key":"12_CR28","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1137\/0208032","volume":"8","author":"LG Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of enumeration and reliability problems. SIAM J. Comput. 8(3), 410\u2013421 (1979). https:\/\/doi.org\/10.1137\/0208032","journal-title":"SIAM J. Comput."},{"issue":"4","key":"12_CR29","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1002\/net.20412","volume":"57","author":"R Zenklusen","year":"2011","unstructured":"Zenklusen, R., Laumanns, M.: High-confidence estimation of small s-t reliabilities in directed acyclic networks. Networks 57(4), 376\u2013388 (2011). https:\/\/doi.org\/10.1002\/net.20412","journal-title":"Networks"}],"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-032-15791-1_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:02:24Z","timestamp":1775001744000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-15791-1_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032157904","9783032157911"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-15791-1_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"1 April 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"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":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"optima2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf-optima.ru","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}