Minmax regret for sink location on dynamic flow paths with general capacities

DOI10.1016/j.dam.2022.02.027zbMath1487.90438arXiv1912.12447OpenAlexW4220830655MaRDI QIDQ2133396

Mordecai J. Golin, Sai Sandeep

Publication date: 29 April 2022

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1912.12447

zbMATH Keywords

minmax regretrobust optimizationdynamic flow networks

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Minimax problems in mathematical programming (90C47) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Minmax regret 1-facility location on uncertain path networks
• An \(O(n \log^2 n)\) algorithm for the optimal sink location problem in dynamic tree networks
• Improved algorithms for computing minmax regret sinks on dynamic path and tree networks
• A survey of dynamic network flows
• An O\((n\log n)\) version of the Averbakh-Berman algorithm for the robust median of a tree
• Min-max and min-max regret versions of combinatorial optimization problems: A survey
• Robust discrete optimization and its applications
• Minmax regret \(k\)-sink location on a dynamic path network with uniform capacities
• Minmax-regret evacuation planning for cycle networks
• Minimax regret 1-sink location problem in dynamic path networks
• Improved algorithms for computing \(k\)-sink on dynamic flow path networks
• A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree
• Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity
• (Almost) Tight bounds and existence theorems for single-commodity confluent flows
• Capacitated Confluent Flows: Complexity and Algorithms
• Minimax regret p-center location on a network with demand uncertainty
• Sink Evacuation on Trees with Dynamic Confluent Flows
• An improved algorithm for the minmax regret median problem on a tree
• Minimax Regret 1-Sink Location Problems in Dynamic Path Networks
• Improved algorithms for the minmax-regret 1-center and 1-median problems
• Constructing Maximal Dynamic Flows from Static Flows
• Quickest Flows Over Time
• Minimax regret vertex 2-sink location problem in dynamic path networks

This page was built for publication: Minmax regret for sink location on dynamic flow paths with general capacities