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

DOI10.1002/NET.22040MaRDI QIDQ6065855zbMATH OpenOpenAlexFDO

Authors Evgeny Gurevsky, Dmitry I. Kopelevich, Sergey Kovalev, M. Y. Kovalyov

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

bicriteria optimizationcontrollable dataknapsack problemmin-sum problemriskshortest pathspanning tree

Mathematics Subject Classification ID

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

Recommendations

• Min-max controllable risk problems
• On the Minimum Risk-Sum Path Problem
• Minimizing risk models in stochastic shortest path problems
• Deterministic risk control for cost-effective network connections
• The Minimum Risk Spanning Tree Problem

Cites work

• A linear time algorithm for the robust recoverable selection problem
• A minimum spanning tree algorithm with inverse-Ackermann type complexity
• A new model for path planning with interval data
• A polynomial solvable minimum risk spanning tree problem with interval data
• A survey of scheduling with controllable processing times
• Batch scheduling with controllable setup and processing times to minimize total completion time
• Bicriterion Single Machine Scheduling with Resource Dependent Processing Times
• Combinatorial optimization. Theory and algorithms
• Convex Matroid Optimization
• Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times
• Deterministic risk control for cost-effective network connections
• Discrete-variable extremum problems
• Efficient algorithms for a family of matroid intersection problems
• Graph theory
• scientific article; zbMATH DE number 1179517 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• Machine scheduling with resource dependent processing times
• Matroid optimization with the interleaving of two ordered sets
• Multicriteria Optimization
• Multicriteria scheduling. Theory, models and algorithms. Translated from the French by Henry Scott.
• On Finding the Maxima of a Set of Vectors
• On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees
• On the Complexity of Some Enumeration Problems for Matroids
• Positive half-products and scheduling with controllable processing times
• Risk models for the prize collecting Steiner tree problems with interval data
• Scheduling with controllable release dates and processing times: Makespan minimization
• Single machine scheduling subject to deadlines and resource dependent processing times
• Steiner tree problems in computer communication networks.
• The shortest route problem with constraints
• Time bounds for selection

Cited in

(1)

• Integer knapsack problems with profit functions of the same value range

This page was built for publication: Min‐sum controllable risk problems with concave risk functions of the same value range

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6065855)