{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T07:40:04Z","timestamp":1749195604341,"version":"3.41.0"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T00:00:00Z","timestamp":1743465600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T00:00:00Z","timestamp":1743465600000},"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 Cesk\u00e9 Republiky","doi-asserted-by":"publisher","award":["23-07270S"],"award-info":[{"award-number":["23-07270S"]}],"id":[{"id":"10.13039\/501100001824","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001823","name":"Ministerstvo \u0160kolstv\u00ed, Ml\u00e1de\u017ee a Telov\u00fdchovy","doi-asserted-by":"publisher","award":["SVV-2023-260699","25-15714S","25-15714S"],"award-info":[{"award-number":["SVV-2023-260699","25-15714S","25-15714S"]}],"id":[{"id":"10.13039\/501100001823","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2025,4]]},"DOI":"10.1007\/s00500-025-10625-9","type":"journal-article","created":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T08:19:14Z","timestamp":1747124354000},"page":"3691-3704","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["0\u20131 Linear programming under interval uncertainty"],"prefix":"10.1007","volume":"29","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-7340-8491","authenticated-orcid":false,"given":"Milan","family":"Hlad\u00edk","sequence":"additional","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":[[2025,5,13]]},"reference":[{"issue":"4","key":"10625_CR1","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1080\/21681015.2018.1437792","volume":"35","author":"H Amirian","year":"2018","unstructured":"Amirian H, Sahraeian R (2018) A hybrid integer grey programming for an integrated problem of project selection and scheduling with interval data. J Ind Prod Eng 35(4):199\u2013213. https:\/\/doi.org\/10.1080\/21681015.2018.1437792","journal-title":"J Ind Prod Eng"},{"issue":"2","key":"10625_CR2","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/PL00011424","volume":"90","author":"I Averbakh","year":"2001","unstructured":"Averbakh I (2001) On the complexity of a class of combinatorial optimization problems with uncertainty. Math Program 90(2):263\u2013272. https:\/\/doi.org\/10.1007\/PL00011424","journal-title":"Math Program"},{"key":"10625_CR3","doi-asserted-by":"crossref","unstructured":"Charnes A, Granot D, Granot F (1977) On intersection cuts in interval integer linear programming. Oper Res 25(2):352\u2013355. https:\/\/www.jstor.org\/stable\/169839","DOI":"10.1287\/opre.25.2.352"},{"issue":"2","key":"10625_CR4","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1057\/palgrave.jors.2600891","volume":"51","author":"JW Chinneck","year":"2000","unstructured":"Chinneck JW, Ramadan K (2000) Linear programming with interval coefficients. J Oper Res Soc 51(2):209\u2013220. https:\/\/doi.org\/10.1057\/palgrave.jors.2600891","journal-title":"J Oper Res Soc"},{"issue":"1","key":"10625_CR5","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/S0167-6377(00)00034-1","volume":"27","author":"A Crema","year":"2000","unstructured":"Crema A (2000) An algorithm for the multiparametric 0\u20131-integer linear programming problem relative to the constraint matrix. Oper Res Lett 27(1):13\u201319. https:\/\/doi.org\/10.1016\/S0167-6377(00)00034-1","journal-title":"Oper Res Lett"},{"key":"10625_CR6","doi-asserted-by":"publisher","unstructured":"G\u00e1lvez ED, Cisternas LA, Pati\u00f1o PS et\u00a0al (2008) Applications of grey programming to process design. In: Braunschweig B, Joulia X (eds) Computer aided chemical engineering, 18 European symposium on computer aided process engineering, vol\u00a025. Elsevier, pp 671\u2013676. https:\/\/doi.org\/10.1016\/S1570-7946(08)80117-4","DOI":"10.1016\/S1570-7946(08)80117-4"},{"issue":"1","key":"10625_CR7","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":"10625_CR8","doi-asserted-by":"publisher","unstructured":"Garajov\u00e1 E, Hlad\u00edk M (2024) Inside the box: 0\u20131 linear programming under interval uncertainty. In: Sergeyev YD, Kvasov DE (eds) Numerical computations: theory and algorithms, Lecture notes in computer science. Springer, Cham, pp 1\u20138. https:\/\/doi.org\/10.1007\/978-3-031-81241-5_24","DOI":"10.1007\/978-3-031-81241-5_24"},{"issue":"3","key":"10625_CR9","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"},{"issue":"5","key":"10625_CR10","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1287\/mnsc.23.5.453","volume":"23","author":"AM Geoffrion","year":"1977","unstructured":"Geoffrion AM, Nauss R (1977) Parametric and postoptimality analysis in integer linear programming. Manag Sci 23(5):453\u2013466","journal-title":"Manag Sci"},{"issue":"3","key":"10625_CR11","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/s10700-009-9060-7","volume":"8","author":"M Hlad\u00edk","year":"2009","unstructured":"Hlad\u00edk M (2009) Optimal value range in interval linear programming. Fuzzy Optim Decis Mak 8(3):283\u2013294. https:\/\/doi.org\/10.1007\/s10700-009-9060-7","journal-title":"Fuzzy Optim Decis Mak"},{"key":"10625_CR12","first-page":"85","volume-title":"Linear programming\u2014new frontiers in theory and applications, Chap\u00a02","author":"M Hlad\u00edk","year":"2012","unstructured":"Hlad\u00edk M (2012) Interval linear programming: a survey. In: Mann Z\u00c1 (ed) Linear programming\u2014new frontiers in theory and applications, Chap\u00a02. Nova Science Publishers, New York, pp 85\u2013120"},{"issue":"11","key":"10625_CR13","doi-asserted-by":"publisher","first-page":"4156","DOI":"10.1016\/j.laa.2013.02.012","volume":"438","author":"M Hlad\u00edk","year":"2013","unstructured":"Hlad\u00edk M (2013) Weak and strong solvability of interval linear systems of equations and inequalities. Linear Algebra Appl 438(11):4156\u20134165. https:\/\/doi.org\/10.1016\/j.laa.2013.02.012","journal-title":"Linear Algebra Appl"},{"key":"10625_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-54621-2_716-1","volume-title":"Encyclopedia of optimization","author":"M Hlad\u00edk","year":"2022","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, pp 1\u201311. https:\/\/doi.org\/10.1007\/978-3-030-54621-2_716-1"},{"issue":"3","key":"10625_CR15","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1016\/0377-2217(94)00093-R","volume":"83","author":"GH Huang","year":"1995","unstructured":"Huang GH, Baetz BW, Patry GG (1995) Grey integer programming: An application to waste management planning under uncertainty. Eur J Oper Res 83(3):594\u2013620. https:\/\/doi.org\/10.1016\/0377-2217(94)00093-R","journal-title":"Eur J Oper Res"},{"key":"10625_CR16","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.28.11.1270","author":"L Jenkins","year":"1982","unstructured":"Jenkins L (1982) Parametric mixed integer programming: an application to solid waste management. Manag Sci. https:\/\/doi.org\/10.1287\/mnsc.28.11.1270","journal-title":"Manag Sci"},{"issue":"1","key":"10625_CR17","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF02055191","volume":"27","author":"L Jenkins","year":"1990","unstructured":"Jenkins L (1990) Parametric methods in integer linear programming. Ann Oper Res 27(1):77\u201396. https:\/\/doi.org\/10.1007\/BF02055191","journal-title":"Ann Oper Res"},{"key":"10625_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78484-5","volume-title":"Discrete optimization with interval data, Studies in fuzziness and soft computing","author":"A Kasperski","year":"2008","unstructured":"Kasperski A (2008) Discrete optimization with interval data, Studies in fuzziness and soft computing, vol 228. Springer, Berlin. https:\/\/doi.org\/10.1007\/978-3-540-78484-5"},{"issue":"6","key":"10625_CR19","doi-asserted-by":"publisher","first-page":"866","DOI":"10.1007\/BF02366445","volume":"30","author":"VI Levin","year":"1994","unstructured":"Levin VI (1994) Interval discrete programming. Cybern Syst Anal 30(6):866\u2013874. https:\/\/doi.org\/10.1007\/BF02366445","journal-title":"Cybern Syst Anal"},{"issue":"4","key":"10625_CR20","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1007\/s11590-014-0791-1","volume":"9","author":"W Li","year":"2015","unstructured":"Li W (2015) A note on dependency between interval linear systems. Optim Lett 9(4):795\u2013797. https:\/\/doi.org\/10.1007\/s11590-014-0791-1","journal-title":"Optim Lett"},{"key":"10625_CR21","first-page":"189","volume":"4","author":"M Libura","year":"1980","unstructured":"Libura M (1980) Integer programming problems with inexact objective function. Control Cybern 4:189\u2013202","journal-title":"Control Cybern"},{"issue":"8","key":"10625_CR22","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":"10625_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-54621-2_718-1","volume-title":"Encyclopedia of optimization","author":"M Mohammadi","year":"2022","unstructured":"Mohammadi M, Hlad\u00edk M, Gentili M (2022) Interval linear programming: optimal value range. In: Pardalos PM, Prokopyev OA (eds) Encyclopedia of optimization. Springer, Cham, pp 1\u201311. https:\/\/doi.org\/10.1007\/978-3-030-54621-2_718-1"},{"key":"10625_CR24","doi-asserted-by":"publisher","unstructured":"Rada M, Hlad\u00edk M, Garajov\u00e1 E (2019) Testing weak optimality of a given solution in interval linear programming revisited: NP-hardness proof, algorithm and some polynomially-solvable cases. Optim Lett 13(4):875\u2013890. https:\/\/doi.org\/10.1007\/s11590-018-1289-z","DOI":"10.1007\/s11590-018-1289-z"},{"key":"10625_CR25","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, Ram\u00edk J et al (eds) Linear optimization problems with inexact data. Springer, US, Boston, MA, pp 79\u2013100. https:\/\/doi.org\/10.1007\/0-387-32698-7_3"},{"key":"10625_CR26","doi-asserted-by":"publisher","unstructured":"Roshchin VA, Semenova NV, Sergiyenko IV (1990) A decomposition approach to the solution of some integer programming problems with inexact data. USSR Comput Math Math Phys 30(3):107\u2013112. https:\/\/doi.org\/10.1016\/0041-5553(90)90197-Z","DOI":"10.1016\/0041-5553(90)90197-Z"},{"key":"10625_CR27","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/BF01070127","volume":"25","author":"VA Roshchin","year":"1989","unstructured":"Roshchin VA, Semenova NV, Sergienko IV (1989) Solution and investigation of one class of inexact integer programming problems. Cybernetics 25:185\u2013193. https:\/\/doi.org\/10.1007\/BF01070127","journal-title":"Cybernetics"},{"issue":"5","key":"10625_CR28","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/BF01071608","volume":"20","author":"NV Semenova","year":"1984","unstructured":"Semenova NV (1984) Solution of a generalized integer-valued programming problem. Cybernetics 20(5):641\u2013651. https:\/\/doi.org\/10.1007\/BF01071608","journal-title":"Cybernetics"},{"issue":"6","key":"10625_CR29","doi-asserted-by":"publisher","first-page":"842","DOI":"10.1007\/BF02366621","volume":"31","author":"IV Sergienko","year":"1995","unstructured":"Sergienko IV, Semenova NV (1995) Integer programming problems with inexact data: exact and approximate solutions. Cybern Syst Anal 31(6):842\u2013851. https:\/\/doi.org\/10.1007\/BF02366621","journal-title":"Cybern Syst Anal"},{"key":"10625_CR30","series-title":"Addison-Wesley series in statistics","volume-title":"Mathematical programming","author":"S Vajda","year":"1961","unstructured":"Vajda S (1961) Mathematical programming. Addison-Wesley series in statistics. Addison-Wesley Publishing Company, Reading"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-025-10625-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-025-10625-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-025-10625-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T07:07:20Z","timestamp":1749193640000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-025-10625-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4]]},"references-count":30,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2025,4]]}},"alternative-id":["10625"],"URL":"https:\/\/doi.org\/10.1007\/s00500-025-10625-9","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2025,4]]},"assertion":[{"value":"6 February 2025","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 May 2025","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 are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}