Min‐sum controllable risk problems with concave risk functions of the same value range

DOI10.1002/net.22040zbMath1528.90218OpenAlexW3146361693MaRDI QIDQ6065855

Mikhail Y. Kovalyov, Evgeny E. Gurevsky, Sergey Kovalev, Dmitry I. Kopelevich

Publication date: 11 December 2023

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.22040

zbMATH Keywords

shortest pathknapsack problemspanning treeriskbicriteria optimizationcontrollable datamin-sum problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27)

Related Items

Integer knapsack problems with profit functions of the same value range

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Risk models for the prize collecting Steiner tree problems with interval data
• Deterministic risk control for cost-effective network connections
• Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times
• Matroid optimization with the interleaving of two ordered sets
• Machine scheduling with resource dependent processing times
• A new model for path planning with interval data
• A polynomial solvable minimum risk spanning tree problem with interval data
• Single machine scheduling subject to deadlines and resource dependent processing times
• Time bounds for selection
• Positive half-products and scheduling with controllable processing times
• A linear time algorithm for the robust recoverable selection problem
• A survey of scheduling with controllable processing times
• Scheduling with controllable release dates and processing times: Makespan minimization
• The shortest route problem with constraints
• Efficient algorithms for a family of matroid intersection problems
• On Finding the Maxima of a Set of Vectors
• Bicriterion Single Machine Scheduling with Resource Dependent Processing Times
• A minimum spanning tree algorithm with inverse-Ackermann type complexity
• Convex Matroid Optimization
• Batch scheduling with controllable setup and processing times to minimize total completion time
• On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees
• Multicriteria Optimization
• Discrete-Variable Extremum Problems
• On the Complexity of Some Enumeration Problems for Matroids
• Combinatorial optimization. Theory and algorithms