Abstract
A min-max controllable risk problem, defined on combinatorial structures which are either simple paths of a directed multigraph or spanning trees of an undirected multigraph, with resource dependent risk functions of the arcs or the edges, is studied. The resource amount is limited, and the objective is to distribute it between the arcs or the edges so that the maximum risk over the arcs of a simple path or the edges of a spanning tree is minimized. Two new solution approaches are presented, which are asymptotically faster than the solution approaches suggested in the literature.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Álvarez-Miranda E, Chen X, Hu J, Hu X, Candia-Véjar A (2011) Deterministic risk control for cost-effective network connections. Theor Comput Sci 412(3):257–264
Álvarez-Miranda E, Candia-Véjar A, Chen XJ, Hu XD, Li B (2014) Risk models for the prize collecting steiner tree problems with interval data. Acta Math Appl Sin Engl Ser 30(1):1–26
Arcelus FJ, Kumar S, Srinivasan G (2011) Channel coordination with manufacturer’s return policies within a newsvendor framework. 4OR 9(3):279–297
Borůvka O (1926) O jistém problému minimálním. Práce Moravské Pr̆írodovĕdecké Spolec̆nosti 3(3):37–53
Chazelle B (2000) A minimum spanning tree algorithm with inverse-Ackermann type complexity. J ACM 47(6):1028–1047
Chen X, Hu J, Hu X (2009a) A new model for path planning with interval data. Comput Oper Res 36(6):1893–1899
Chen X, Hu J, Hu X (2009b) A polynomial solvable minimum risk spanning tree problem with interval data. Eur J Oper Res 198(1):43–46
Cheng TCE, Janiak A, Kovalyov MY (1998) Bicriterion single machine scheduling with resource dependent processing times. SIAM J Optim 8(2):617–630
Cheng TCE, Kovalyov MY, Shakhlevich NV (2006) Scheduling with controllable release dates and processing times: Makespan minimization. Eur J Oper Res 175(2):751–768
Coffman EG Jr, Matsypura D, Timkovsky VG (2010) Strategy vs risk in margining portfolios of options. 4OR 8(4):375–386
Dijkstra EW (1959) A note on two problems in connexion with graphs. Numer Math 1(1):269–271
Ehrgott M (2005) Multicriteria optimization, 2nd edn. Springer, Berlin
Fredman ML, Tarjan RE (1987) Fibonacci heaps and their uses in improved network optimization algorithms. J ACM 34(3):596–615
Grigoriev A, Sviridenko M, Uetz M (2007) Machine scheduling with resource dependent processing times. Math Program Ser B 110(1):209–228
Hu J (2010) Minimizing maximum risk for fair network connection with interval data. Acta Math Appl Sin Engl Ser 26(1):33–40
Janiak A, Kovalyov MY (1996) Single machine scheduling subject to deadlines and resource dependent processing times. Eur J Oper Res 94(2):284–291
Janiak A, Kovalyov MY, Kubiak W, Werner F (2005) Positive half-products and scheduling with controllable processing times. Eur J Oper Res 165(2):416–422
Megiddo N (1979) Combinatorial optimization with rational objective functions. Math Oper Res 4(4):414–424
Ng CT, Cheng TCE, Kovalyov MY (2003) Batch scheduling with controllable setup and processing times to minimize total completion time. J Oper Res Soc 54(5):499–506
Radzik T (1998) Fractional combinatorial optimization. In: Du DZ, Pardalos PM (eds) Handbook of combinatorial optimization, vol 3. Springer, New York, pp 429–478
Scutellà MG, Recchia R (2010) Robust portfolio asset allocation and risk measures. 4OR 8(2):113–139
Sevaux M, Sörensen K (2004) A genetic algorithm for robust schedules in a one-machine environment with ready times and due dates. 4OR 2(2):129–147
Shabtay D, Steiner G (2007) A survey of scheduling with controllable processing times. Discrete Appl Math 155:1643–1666
Shioura A, Shakhlevich NV, Strusevich VA (2015) Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times. Math Program Ser A 153(2):495–534
T’kindt V, Billaut JC (2006) Multicriteria scheduling: theory, models and algorithms, 2nd edn. Springer, Berlin
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that they have no conflict of interest.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Gurevsky, E., Kovalev, S. & Kovalyov, M.Y. Min-max controllable risk problems. 4OR-Q J Oper Res 19, 93–101 (2021). https://doi.org/10.1007/s10288-020-00434-1
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10288-020-00434-1