{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T04:02:49Z","timestamp":1750910569310,"version":"3.41.0"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,11,16]],"date-time":"2024-11-16T00:00:00Z","timestamp":1731715200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,16]],"date-time":"2024-11-16T00:00:00Z","timestamp":1731715200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001824","name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky","doi-asserted-by":"publisher","award":["23-07270\u00a0S"],"award-info":[{"award-number":["23-07270\u00a0S"]}],"id":[{"id":"10.13039\/501100001824","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001823","name":"Ministerstvo \u0160kolstv\u00ed, Ml\u00e1de\u017ee a T\u011blov\u00fdchovy","doi-asserted-by":"publisher","award":["SVV-2023-260699","23-07270\u00a0S"],"award-info":[{"award-number":["SVV-2023-260699","23-07270\u00a0S"]}],"id":[{"id":"10.13039\/501100001823","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cent Eur J Oper Res"],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1007\/s10100-024-00947-8","type":"journal-article","created":{"date-parts":[[2024,11,16]],"date-time":"2024-11-16T06:47:24Z","timestamp":1731739644000},"page":"819-834","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Complexity of computing the worst optimal value of interval transportation problems"],"prefix":"10.1007","volume":"33","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3052-5970","authenticated-orcid":false,"given":"Elif","family":"Garajov\u00e1","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1761-897X","authenticated-orcid":false,"given":"Miroslav","family":"Rada","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,11,16]]},"reference":[{"issue":"8","key":"947_CR1","doi-asserted-by":"publisher","first-page":"1893","DOI":"10.1007\/s11590-012-0530-4","volume":"7","author":"M Allahdadi","year":"2013","unstructured":"Allahdadi M, Mishmast Nehi H (2013) The optimal solution set of the interval linear programming problems. Optimization Lett 7(8):1893\u20131911. https:\/\/doi.org\/10.1007\/s11590-012-0530-4","journal-title":"Optimization Lett"},{"issue":"2","key":"947_CR2","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0166-218X(95)00103-X","volume":"70","author":"RE Burkard","year":"1996","unstructured":"Burkard RE, Klinz B, Rudolf R (1996) Perspectives of Monge properties in optimization. Discret Appl Math 70(2):95\u2013161. https:\/\/doi.org\/10.1016\/0166-218X(95)00103-X","journal-title":"Discret Appl Math"},{"key":"947_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2021.102492","volume":"104","author":"F Carrabs","year":"2021","unstructured":"Carrabs F, Cerulli R, D\u2019Ambrosio C et al (2021) An improved heuristic approach for the interval immune transportation problem. Omega 104:102492. https:\/\/doi.org\/10.1016\/j.omega.2021.102492","journal-title":"Omega"},{"key":"947_CR4","unstructured":"\u010cern\u00fd M (2019) Monge property for interval matrices. Bachelor thesis, Charles University, Faculty of Mathematics and Physics, Prague, https:\/\/dspace.cuni.cz\/handle\/20.500.11956\/108339"},{"key":"947_CR5","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/978-3-319-67308-0_37","volume-title":"Optimization and Decision Science: Methodologies and Applications","author":"R. Cerulli","year":"2017","unstructured":"Cerulli R., D\u2019Ambrosio C., Gentili M. (2017) Best and Worst Values of the Optimal Cost of the Interval Transportation Problem. In: Sforza Antonio, Sterle Claudio (eds) Optimization and Decision Science: Methodologies and Applications. Springer International Publishing, Cham, pp 367\u2013374. https:\/\/doi.org\/10.1007\/978-3-319-67308-0_37"},{"issue":"3","key":"947_CR6","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/0165-0114(84)90057-5","volume":"13","author":"S Chanas","year":"1984","unstructured":"Chanas S, Ko\u0142odziejczyk W, Machaj A (1984) A fuzzy approach to the transportation problem. Fuzzy Sets Syst 13(3):211\u2013221. https:\/\/doi.org\/10.1016\/0165-0114(84)90057-5","journal-title":"Fuzzy Sets Syst"},{"issue":"2","key":"947_CR7","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1080\/03081069308717511","volume":"17","author":"S Chanas","year":"1993","unstructured":"Chanas S, Delgado M, Verdegay JL et al (1993) Interval and fuzzy extensions of classical transportation problems. Transp Plan Technol 17(2):203\u2013218. https:\/\/doi.org\/10.1080\/03081069308717511","journal-title":"Transp Plan Technol"},{"issue":"2","key":"947_CR8","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/0377-2217(87)90022-1","volume":"31","author":"A Charnes","year":"1987","unstructured":"Charnes A, Duffuaa S, Ryan M (1987) The more-for-less paradox in linear programming. Eur J Oper Res 31(2):194\u2013197. https:\/\/doi.org\/10.1016\/0377-2217(87)90022-1","journal-title":"Eur J Oper Res"},{"key":"947_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2019.04.002","volume":"95","author":"C D\u2019Ambrosio","year":"2020","unstructured":"D\u2019Ambrosio C, Gentili M, Cerulli R (2020) The optimal value range problem for the Interval (immune) Transportation Problem. Omega 95:102059. https:\/\/doi.org\/10.1016\/j.omega.2019.04.002","journal-title":"Omega"},{"issue":"3","key":"947_CR10","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1016\/S0166-218X(03)00327-5","volume":"130","author":"VG De\u012dneko","year":"2003","unstructured":"De\u012dneko VG, Klinz B, Woeginger GJ (2003) Which matrices are immune against the transportation paradox? Discret Appl Math 130(3):495\u2013501. https:\/\/doi.org\/10.1016\/S0166-218X(03)00327-5","journal-title":"Discret Appl Math"},{"issue":"3","key":"947_CR11","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1007\/s10100-023-00841-9","volume":"31","author":"E Garajov\u00e1","year":"2023","unstructured":"Garajov\u00e1 E, Rada M (2023) Interval transportation problem: Feasibility, optimality and the worst optimal value. CEJOR 31(3):769\u2013790. https:\/\/doi.org\/10.1007\/s10100-023-00841-9","journal-title":"CEJOR"},{"key":"947_CR12","unstructured":"Garajov\u00e1 E, Rada M (2023b) Interval Transportation Problem: The Worst Finite Optimal Value is Hard for Inequalities. In: Drobne S, Zadnik\u00a0Stirn L, Kljaji\u0107 Bor\u0161tnar et al. M (eds) Proceedings of the 17th International Symposium on Operational Research SOR\u201923, Bled, Slovenia, September 20-22, 2023. Slovenian Society Informatika, Ljubljana, Slovenia, pp 367\u2013370, https:\/\/www.drustvo-informatika.si\/sekcije-drustva?stran=publikacije-sor"},{"key":"947_CR13","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-031-50320-7_6","volume-title":"Dynamics of Information Systems: 6th International Conference, DIS 2023, Prague, Czech Republic, September 3\u20136, 2023, Revised Selected Papers","author":"Elif Garajov\u00e1","year":"2024","unstructured":"Garajov\u00e1 Elif, Rada Miroslav (2024) A Quasi-extreme Reduction for\u00a0Interval Transportation Problems. In: Moosaei Hossein, Hlad\u00edk Milan, Pardalos Panos M. (eds) Dynamics of Information Systems: 6th International Conference, DIS 2023, Prague, Czech Republic, September 3\u20136, 2023, Revised Selected Papers. Springer Nature Switzerland, Cham, pp 83\u201392. https:\/\/doi.org\/10.1007\/978-3-031-50320-7_6"},{"issue":"3","key":"947_CR14","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1007\/s10100-018-0580-5","volume":"27","author":"E Garajov\u00e1","year":"2019","unstructured":"Garajov\u00e1 E, Hlad\u00edk M, Rada M (2019) Interval linear programming under transformations: Optimal solutions and optimal value range. CEJOR 27(3):601\u2013614. https:\/\/doi.org\/10.1007\/s10100-018-0580-5","journal-title":"CEJOR"},{"key":"947_CR15","unstructured":"Hennig K, Schwarz R (2016) Using Bilevel Optimization to find Severe Transport Situations in Gas Transmission Networks. Tech. Rep. 16-68, Zuse-Institut Berlin, https:\/\/nbn-resolving.org\/urn:nbn:de:0297-zib-61519"},{"issue":"1\u20134","key":"947_CR16","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1002\/sapm1941201224","volume":"20","author":"FL Hitchcock","year":"1941","unstructured":"Hitchcock FL (1941) The Distribution of a Product from Several Sources to Numerous Localities. J Math Phys 20(1\u20134):224\u2013230. https:\/\/doi.org\/10.1002\/sapm1941201224","journal-title":"J Math Phys"},{"key":"947_CR17","unstructured":"Hlad\u00edk M (2012) Interval linear programming: A survey. In: Mann Z\u00c1 (ed) Linear Programming \u2013 New Frontiers in Theory and Applications. Nova Science Publishers, New York, chap\u00a02, p 85\u2013120"},{"issue":"7","key":"947_CR18","doi-asserted-by":"publisher","first-page":"1459","DOI":"10.1007\/s11590-016-1088-3","volume":"11","author":"M Hlad\u00edk","year":"2017","unstructured":"Hlad\u00edk M (2017) On strong optimality of interval linear programming. Optimization Lett 11(7):1459\u20131468. https:\/\/doi.org\/10.1007\/s11590-016-1088-3","journal-title":"Optimization Lett"},{"issue":"2","key":"947_CR19","doi-asserted-by":"publisher","first-page":"245","DOI":"10.17535\/crorr.2018.0019","volume":"9","author":"M Hlad\u00edk","year":"2018","unstructured":"Hlad\u00edk M (2018) The worst case finite optimal value in interval linear programming. Croatian Operational Res Rev 9(2):245\u2013254. https:\/\/doi.org\/10.17535\/crorr.2018.0019","journal-title":"Croatian Operational Res Rev"},{"key":"947_CR20","doi-asserted-by":"publisher","unstructured":"Hlad\u00edk M, Garajov\u00e1 E (2022) Interval Linear Programming: Set of Optimal Solutions. In: Pardalos PM, Prokopyev OA (eds) Encyclopedia of Optimization. Springer, Cham, p 1\u201311, https:\/\/doi.org\/10.1007\/978-3-030-54621-2_716-1","DOI":"10.1007\/978-3-030-54621-2_716-1"},{"key":"947_CR21","unstructured":"Hlavat\u00fd R, Bro\u017eov\u00e1 H (2017) Robust optimization approach in transportation problem. In: Proceedings of the 35th International Conference on Mathematical Methods in Economics (MME 2017). University of Hradec Kr\u00e1lov\u00e9, Hradec Kr\u00e1lov\u00e9, Czech Republic, pp 225\u2013230, https:\/\/csov.vse.cz\/eng\/publications"},{"key":"947_CR22","doi-asserted-by":"crossref","unstructured":"Hoffman AJ (1963) On simple linear programming problems. In: Proceedings of Symposia in Pure Mathematics, pp 317\u2013327","DOI":"10.1090\/pspum\/007\/0157778"},{"issue":"2","key":"947_CR23","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1002\/net.22060","volume":"79","author":"K Hoppmann-Baum","year":"2022","unstructured":"Hoppmann-Baum K (2022) On the Complexity of Computing Maximum and Minimum Min-Cost-Flows. Networks 79(2):236\u2013248. https:\/\/doi.org\/10.1002\/net.22060","journal-title":"Networks"},{"issue":"1","key":"947_CR24","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1016\/j.ejor.2014.05.004","volume":"239","author":"ZAMS Juman","year":"2014","unstructured":"Juman ZAMS, Hoque MA (2014) A heuristic solution technique to attain the minimal total cost bounds of transporting a homogeneous product with varying demands and supplies. Eur J Oper Res 239(1):146\u2013156. https:\/\/doi.org\/10.1016\/j.ejor.2014.05.004","journal-title":"Eur J Oper Res"},{"issue":"4","key":"947_CR25","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/S0305-0483(03)00054-9","volume":"31","author":"ST Liu","year":"2003","unstructured":"Liu ST (2003) The total cost bounds of the transportation problem with varying demand and supply. Omega 31(4):247\u2013251. https:\/\/doi.org\/10.1016\/S0305-0483(03)00054-9","journal-title":"Omega"},{"issue":"8","key":"947_CR26","doi-asserted-by":"publisher","first-page":"2479","DOI":"10.1016\/j.laa.2013.06.022","volume":"439","author":"J Luo","year":"2013","unstructured":"Luo J, Li W (2013) Strong optimal solutions of interval linear programming. Linear Algebra Appl 439(8):2479\u20132493. https:\/\/doi.org\/10.1016\/j.laa.2013.06.022","journal-title":"Linear Algebra Appl"},{"key":"947_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-54621-2_718-1","volume-title":"Encyclopedia of Optimization","author":"Mohsen Mohammadi","year":"2020","unstructured":"Mohammadi Mohsen, Hlad\u00edk Milan, Gentili Monica (2020) Interval Linear Programming: Optimal Value Range. In: Pardalos Panos M., Prokopyev Oleg A. (eds) Encyclopedia of Optimization. Springer International Publishing, Cham, pp 1\u201311. https:\/\/doi.org\/10.1007\/978-3-030-54621-2_718-1"},{"key":"947_CR28","unstructured":"Monge G (1781) M\u00e9moire sur la th\u00e9orie des d\u00e9blais et des remblais. Mem Math Phys Acad Royale Sci pp 666\u2013704"},{"key":"947_CR29","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/0-387-32698-7_3","volume-title":"Linear Optimization Problems with Inexact Data","author":"J. Rohn","year":"2006","unstructured":"Rohn J. (2006) Interval linear programming. In: Fiedler M, Nedoma J et al (eds) Linear Optimization Problems with Inexact Data. Kluwer Academic Publishers, Boston, pp 79\u2013100. https:\/\/doi.org\/10.1007\/0-387-32698-7_3"},{"issue":"2","key":"947_CR30","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1002\/nav.3800180206","volume":"18","author":"W Szwarc","year":"1971","unstructured":"Szwarc W (1971) The transportation paradox. Naval Res Logist Quarterly 18(2):185\u2013202. https:\/\/doi.org\/10.1002\/nav.3800180206","journal-title":"Naval Res Logist Quarterly"},{"key":"947_CR31","doi-asserted-by":"publisher","unstructured":"Tucker W (2011) Interval Arithmetic. In: Validated Numerics: A Short Introduction to Rigorous Computations. Princeton University Press, p 24\u201345, https:\/\/doi.org\/10.1515\/9781400838974-004","DOI":"10.1515\/9781400838974-004"},{"issue":"5","key":"947_CR32","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1287\/opre.11.5.759","volume":"11","author":"AC Williams","year":"1963","unstructured":"Williams AC (1963) Stoch Transp Probl. Operations Res 11(5):759\u2013770. https:\/\/doi.org\/10.1287\/opre.11.5.759","journal-title":"Stoch Transp Probl. Operations Res"},{"key":"947_CR33","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.omega.2016.06.007","volume":"68","author":"F Xie","year":"2017","unstructured":"Xie F, Butt MM, Li Z et al (2017) An upper bound on the minimal total cost of the transportation problem with varying demands and supplies. Omega 68:105\u2013118. https:\/\/doi.org\/10.1016\/j.omega.2016.06.007","journal-title":"Omega"}],"container-title":["Central European Journal of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-024-00947-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10100-024-00947-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-024-00947-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T06:16:03Z","timestamp":1750832163000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10100-024-00947-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,16]]},"references-count":33,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["947"],"URL":"https:\/\/doi.org\/10.1007\/s10100-024-00947-8","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"type":"print","value":"1435-246X"},{"type":"electronic","value":"1613-9178"}],"subject":[],"published":{"date-parts":[[2024,11,16]]},"assertion":[{"value":"29 October 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 November 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no Conflict of interest to declare that is relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}