{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T20:24:32Z","timestamp":1768335872054,"version":"3.49.0"},"reference-count":10,"publisher":"MathDoc\/Centre Mersenne","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>In this paper, we consider a robust combinatorial optimization problem with uncertain weights and propose an uncertainty set that generalizes interval uncertainty by imposing lower and upper bounds on deviations of subsets of items. We prove that if the number of such subsets is fixed and the family of these subsets is laminar, then the robust combinatorial optimization problem can be solved by solving a fixed number of nominal problems. This result generalizes a previous similar result for the case where the family of these subsets is a partition of the set of items.<\/jats:p>","DOI":"10.5802\/ojmo.23","type":"journal-article","created":{"date-parts":[[2023,6,5]],"date-time":"2023-06-05T01:03:24Z","timestamp":1685927004000},"page":"1-7","source":"Crossref","is-referenced-by-count":3,"title":["Short Paper - A Note on Robust Combinatorial Optimization with Generalized Interval Uncertainty"],"prefix":"10.5802","volume":"4","author":[{"given":"Hande","family":"Yaman","sequence":"first","affiliation":[]}],"member":"3842","published-online":{"date-parts":[[2023,6,5]]},"reference":[{"key":"key2025101710011111450_1","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-1-4419-0534-5_7","article-title":"A hybrid polyhedral uncertainty model for the robust network loading problem","volume":"46","author":"Alt\u0131n, Ay\u015feg\u00fcl","year":"2011","unstructured":"[1] Alt\u0131n, Ay\u015feg\u00fcl; Yaman, Hande; P\u0131nar, Mustafa \u00c7. A hybrid polyhedral uncertainty model for the robust network loading problem, Performance models and risk management in communications systems (Springer Optimization and Its Applications), Volume 46, Springer, 2011, pp. 157-172","journal-title":"Performance models and risk management in communications systems"},{"issue":"1","key":"key2025101710011111450_2","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s10107-003-0396-4","article-title":"Robust discrete optimization and network flows","volume":"98","author":"Bertsimas, Dimitris","year":"2003","unstructured":"[2] Bertsimas, Dimitris; Sim, Melvyn Robust discrete optimization and network flows, Math. Program., Volume 98 (2003) no. 1, pp. 49-71","journal-title":"Math. Program."},{"issue":"2","key":"key2025101710011111450_3","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1287\/opre.2017.1660","article-title":"Robust defibrillator deployment under cardiac arrest location uncertainty via row-and-column generation","volume":"66","author":"Chan, Timothy C. Y.","year":"2018","unstructured":"[3] Chan, Timothy C. Y.; Shen, Zuo-Jun Max; Siddiq, Auyon Robust defibrillator deployment under cardiac arrest location uncertainty via row-and-column generation, Oper. Res., Volume 66 (2018) no. 2, pp. 358-379","journal-title":"Oper. Res."},{"key":"key2025101710011111450_4","first-page":"95","article-title":"A flexible model for resource management in virtual private networks","author":"Duffield, Nick G.","year":"1999","unstructured":"[4] Duffield, Nick G.; Goyal, Pawan; Greenberg, Albert; Mishra, Partho; Ramakrishnan, Kadangode K; van der Merive, Jacobus E. A flexible model for resource management in virtual private networks, Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication, ACM Press (1999), pp. 95-108","journal-title":"Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication"},{"issue":"2","key":"key2025101710011111450_5","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1006\/jagm.1997.0866","article-title":"Designing least-cost nonblocking broadband networks","volume":"24","author":"Fingerhut, J. Andrew","year":"1997","unstructured":"[5] Fingerhut, J. Andrew; Suri, Subhash; Turner, Jonathan S. Designing least-cost nonblocking broadband networks, J. Algorithms, Volume 24 (1997) no. 2, pp. 287-309","journal-title":"J. Algorithms"},{"issue":"3","key":"key2025101710011111450_6","first-page":"18","article-title":"Robust combinatorial optimization with locally budgeted uncertainty","volume":"2","author":"Goerigk, Marc","year":"2021","unstructured":"[6] Goerigk, Marc; Lendl, Stefan Robust combinatorial optimization with locally budgeted uncertainty, Open J. Math. Optim., Volume 2 (2021) no. 3, p. 18","journal-title":"Open J. Math. Optim."},{"issue":"4","key":"key2025101710011111450_7","doi-asserted-by":"publisher","first-page":"1239","DOI":"10.1287\/trsc.2014.0559","article-title":"An adaptive memory programming framework for the robust capacitated vehicle routing problem","volume":"50","author":"Gounaris, Chrysanthos E.","year":"2016","unstructured":"[7] Gounaris, Chrysanthos E.; Repoussis, Panagiotis P.; Tarantilis, Christos D.; Wiesemann, Wolfram; Floudas, Christodoulos A. An adaptive memory programming framework for the robust capacitated vehicle routing problem, Transp. Sci., Volume 50 (2016) no. 4, pp. 1239-1260","journal-title":"Transp. Sci."},{"issue":"3","key":"key2025101710011111450_8","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1287\/opre.1120.1136","article-title":"The robust capacitated vehicle routing problem under demand uncertainty","volume":"61","author":"Gounaris, Chrysanthos E.","year":"2013","unstructured":"[8] Gounaris, Chrysanthos E.; Wiesemann, Wolfram; Floudas, Christodoulos A. The robust capacitated vehicle routing problem under demand uncertainty, Oper. Res., Volume 61 (2013) no. 3, pp. 677-693","journal-title":"Oper. Res."},{"key":"key2025101710011111450_9","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.disopt.2017.09.004","article-title":"Robust combinatorial optimization with knapsack uncertainty","volume":"27","author":"Poss, Michael","year":"2018","unstructured":"[9] Poss, Michael Robust combinatorial optimization with knapsack uncertainty, Discrete Optim., Volume 27 (2018), pp. 88-102","journal-title":"Discrete Optim."},{"issue":"6","key":"key2025101710011111450_10","doi-asserted-by":"publisher","first-page":"1358","DOI":"10.1287\/opre.2014.1314","article-title":"Distributionally robust convex optimization","volume":"62","author":"Wiesemann, Wolfram","year":"2014","unstructured":"[10] Wiesemann, Wolfram; Kuhn, Daniel; Sim, Melvyn Distributionally robust convex optimization, Oper. Res., Volume 62 (2014) no. 6, pp. 1358-1376","journal-title":"Oper. Res."}],"container-title":["Open Journal of Mathematical Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/ojmo.centre-mersenne.org\/item\/10.5802\/ojmo.23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T08:02:53Z","timestamp":1760688173000},"score":1,"resource":{"primary":{"URL":"https:\/\/ojmo.centre-mersenne.org\/articles\/10.5802\/ojmo.23\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,5]]},"references-count":10,"alternative-id":["10.5802\/ojmo.23"],"URL":"https:\/\/doi.org\/10.5802\/ojmo.23","relation":{},"ISSN":["2777-5860"],"issn-type":[{"value":"2777-5860","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,6,5]]},"article-number":"4"}}