{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,9]],"date-time":"2025-12-09T11:39:12Z","timestamp":1765280352498,"version":"3.37.3"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T00:00:00Z","timestamp":1676592000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T00:00:00Z","timestamp":1676592000000},"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":["P403-20-17529S"],"award-info":[{"award-number":["P403-20-17529S"]}],"id":[{"id":"10.13039\/501100001824","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":[[2023,9]]},"DOI":"10.1007\/s10100-023-00841-9","type":"journal-article","created":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T08:34:58Z","timestamp":1676622898000},"page":"769-790","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Interval transportation problem: feasibility, optimality and the worst optimal value"],"prefix":"10.1007","volume":"31","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":[[2023,2,17]]},"reference":[{"key":"841_CR1","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":"841_CR2","doi-asserted-by":"publisher","unstructured":"Cerulli R, D\u2019Ambrosio C, Gentili M (2017) Best and worst values of the optimal cost of the interval transportation problem. In: Optimization and decision science: methodologies and applications. Springer, Cham, Springer PROMS, pp 367\u2013374. https:\/\/doi.org\/10.1007\/978-3-319-67308-0_37","DOI":"10.1007\/978-3-319-67308-0_37"},{"issue":"2","key":"841_CR3","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"},{"key":"841_CR4","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":"1","key":"841_CR5","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/s10589-018-0029-8","volume":"72","author":"E Garajov\u00e1","year":"2019","unstructured":"Garajov\u00e1 E, Hlad\u00edk M (2019) On the optimal solution set in interval linear programming. Comput Optim Appl 72(1):269\u2013292. https:\/\/doi.org\/10.1007\/s10589-018-0029-8","journal-title":"Comput Optim Appl"},{"key":"841_CR6","unstructured":"Garajov\u00e1 E, Rada M (2021) Exact method for the worst optimal value of an interval transportation problem. In: Proceedings of the 16th international symposium on operational research, SOR 2021, pp 545\u2013550"},{"key":"841_CR7","doi-asserted-by":"publisher","unstructured":"Garajov\u00e1 E, Hlad\u00edk M, Rada M (2017) On the properties of interval linear programs with a fixed coefficient matrix. In: Sforza A, Sterle C (eds) Optimization and decision science: methodologies and applications, Springer proceedings in mathematics & statistics, vol 217. Springer, Cham, pp 393\u2013401. https:\/\/doi.org\/10.1007\/978-3-319-67308-0_40","DOI":"10.1007\/978-3-319-67308-0_40"},{"key":"841_CR8","unstructured":"Garajov\u00e1 E, Hlad\u00edk M, Rada M (2020) Interval transportation problem: The best and the worst (feasible) scenario. In: Kapounek S, Vr\u00e1nov\u00e1 H (eds) 38th international conference on mathematical methods in economics 2020 (MME 2020). Conference proceedings. Mendel University in Brno, pp 122\u2013127"},{"key":"841_CR9","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1080\/02331938108842705","volume":"12","author":"W Gerlach","year":"1981","unstructured":"Gerlach W (1981) Zur L\u00f6sung linearer Ungleichungssysteme bei St\u00f6rung der rechten Seite und der Koeffizientenmatrix. Optimization 12:41\u201343. https:\/\/doi.org\/10.1080\/02331938108842705","journal-title":"Optimization"},{"issue":"1\u20134","key":"841_CR10","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":"841_CR11","first-page":"85","volume-title":"Linear programming\u2013new Frontiers in theory and applications","author":"M Hlad\u00edk","year":"2012","unstructured":"Hlad\u00edk M (2012) Interval linear programming: a survey. In: Mann ZA (ed) Linear programming\u2013new Frontiers in theory and applications. Nova Science Publishers, New York, pp 85\u2013120"},{"issue":"7","key":"841_CR12","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. Optim Lett 11(7):1459\u20131468. https:\/\/doi.org\/10.1007\/s11590-016-1088-3","journal-title":"Optim Lett"},{"issue":"2","key":"841_CR13","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. Croat Oper Res Rev 9(2):245\u2013254. https:\/\/doi.org\/10.17535\/crorr.2018.0019","journal-title":"Croat Oper Res Rev"},{"issue":"2","key":"841_CR14","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":"841_CR15","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1016\/j.ejor.2014.05.004","volume":"239","author":"Z Juman","year":"2014","unstructured":"Juman Z, Hoque M (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":"841_CR16","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":"1","key":"841_CR17","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/BF01386090","volume":"6","author":"W Oettli","year":"1964","unstructured":"Oettli W, Prager W (1964) Compatibility of approximate solution of linear equations with given error bounds for coefficients and right-hand sides. Numer Math 6(1):405\u2013409. https:\/\/doi.org\/10.1007\/BF01386090","journal-title":"Numer Math"},{"key":"841_CR18","doi-asserted-by":"publisher","unstructured":"Rohn J (2006) Interval linear programming. In: Fiedler M, Nedoma J, Ram\u00edk J, et\u00a0al (eds) Linear optimization problems with inexact data. Springer US, Boston, MA, pp 79\u2013100. https:\/\/doi.org\/10.1007\/0-387-32698-7_3","DOI":"10.1007\/0-387-32698-7_3"},{"issue":"2","key":"841_CR19","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 Q 18(2):185\u2013202. https:\/\/doi.org\/10.1002\/nav.3800180206","journal-title":"Naval Res Logist Q"},{"key":"841_CR20","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-023-00841-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10100-023-00841-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-023-00841-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,15]],"date-time":"2023-06-15T15:18:02Z","timestamp":1686842282000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10100-023-00841-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,17]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["841"],"URL":"https:\/\/doi.org\/10.1007\/s10100-023-00841-9","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"type":"print","value":"1435-246X"},{"type":"electronic","value":"1613-9178"}],"subject":[],"published":{"date-parts":[[2023,2,17]]},"assertion":[{"value":"24 January 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 February 2023","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 conflicts of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}