Minmax regret \(k\)-sink location on a dynamic path network with uniform capacities
From MaRDI portal
Publication:2319636
DOI10.1007/s00453-019-00589-2zbMath1431.90031OpenAlexW2964145737WikidataQ127781326 ScholiaQ127781326MaRDI QIDQ2319636
John E. Augustine, Mordecai J. Golin, Guru Prakash Arumugam, Prashanth Srikanthan
Publication date: 20 August 2019
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-019-00589-2
Programming involving graphs or networks (90C35) Minimax problems in mathematical programming (90C47) Deterministic network models in operations research (90B10)
Related Items
Multiple sink location problem in path networks with a combinational objective, Minmax regret for sink location on dynamic flow paths with general capacities, Minmax regret 1-sink location problems on dynamic flow path networks with parametric weights, Unnamed Item, Minimax regret 1-median problem in dynamic path networks, Minmax regret \(k\)-sink location on a dynamic path network with uniform capacities
Cites Work
- Unnamed Item
- Unnamed Item
- Multidimensional divide-and-conquer
- Minmax regret 1-facility location on uncertain path networks
- Minimax regret 1-sink location problem with accessibility in dynamic general networks
- Minimax regret 1-sink location problem in dynamic cycle networks
- A linear time algorithm for computing minmax regret 1-median on a tree network
- Minmax regret 1-center algorithms for path/tree/unicycle/cactus 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
- Multiple sink location problems in dynamic path networks
- An O\((n\log n)\) version of the Averbakh-Berman algorithm for the robust median of a tree
- A note on the minmax regret centdian location on trees
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Robust discrete optimization and its applications
- Minsum \(k\)-sink problem on dynamic flow path networks
- Interval data minmax regret network optimization problems
- Minmax regret \(k\)-sink location on a dynamic path network with uniform capacities
- Minimax regret 1-sink location problem in dynamic path networks
- On the minmax regret path median problem on trees
- Improved algorithms for computing \(k\)-sink on dynamic flow path networks
- The Quickest Transshipment Problem
- Minmax Regret 1-Facility Location on Uncertain Path Networks
- Minimax Regret Single-Facility Ordered Median Location Problems on Networks
- A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree
- Minimax regret path location on trees
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Minimax regret p-center location on a network with demand uncertainty
- Sink Evacuation on Trees with Dynamic Confluent Flows
- Minmax regret combinatorial optimization problems: an Algorithmic Perspective
- Minimax Regret 1-Sink Location Problems in Dynamic Path Networks
- Improved algorithms for the minmax-regret 1-center and 1-median problems
- Non-approximability and Polylogarithmic Approximations of the Single-Sink Unsplittable and Confluent Dynamic Flow Problems
- Minimax Regret k-sink Location Problem in Dynamic Path Networks
- Constructing Maximal Dynamic Flows from Static Flows
- Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity
- Minimax regret vertex 2-sink location problem in dynamic path networks
