Minimax regret 1-median problem in dynamic path networks (Q726099): Difference between revisions

Latest revision as of 05:43, 16 July 2024

scientific article; zbMATH DE number 6631016

Minimax Regret 1-Median Problem in Dynamic Path Networks

Language	Label	Description	Also known as
English	Minimax regret 1-median problem in dynamic path networks	scientific article; zbMATH DE number 6631016	Minimax Regret 1-Median Problem in Dynamic Path Networks

Statements

instance of

scholarly article

0 references

title

Minimax regret 1-median problem in dynamic path networks (English)

0 references

Minimax Regret 1-Median Problem in Dynamic Path Networks (English)

0 references

0 references

0 references

0 references

0 references

0 references

Theory of Computing Systems

0 references

Lecture Notes in Computer Science

0 references

publication date

3 August 2018

0 references

29 September 2016

0 references

full work available at URL

https://arxiv.org/abs/1509.07600

0 references

zbMATH Keywords

minimax regret

0 references

sink location

0 references

dynamic flow

0 references

evacuation planning

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Algorithms for the robust 1-center problem on a tree

0 references

A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree

0 references

Improved Algorithms for Computing Minmax Regret 1-Sink and 2-Sink on Path Network

0 references

A linear time algorithm for computing minmax regret 1-median on a tree network

0 references

An O\((n\log n)\) version of the Averbakh-Berman algorithm for the robust median of a tree

0 references

Minmax-regret robust 1-median location on a tree

0 references

Minimax Regret 1-Sink Location Problems in Dynamic Path Networks

0 references

A note on the minmax regret centdian location on trees

0 references

Linear Time Algorithms for Two- and Three-Variable Linear Programs

0 references

Minimax regret 1-sink location problem in dynamic path networks

0 references

Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity

0 references

Multiple Sink Location Problems in Dynamic Path Networks

0 references

Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity

0 references

Multiple sink location problems in dynamic path networks

0 references

An \(O(n \log^2 n)\) algorithm for the optimal sink location problem in dynamic tree networks

0 references

Minmax Regret 1-Facility Location on Uncertain Path Networks

0 references

Minmax regret \(k\)-sink location on a dynamic path network with uniform capacities

0 references

Constructing Maximal Dynamic Flows from Static Flows

0 references

Identifiers

zbMATH Open document ID

1397.90236

0 references

1397.90235

0 references

DOI

10.1007/s00224-017-9783-8

0 references

10.1007/978-3-319-44543-4_10

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:726099

@@ Property / cites work @@
+Algorithms for the robust 1-center problem on a tree
+Normal rank
@@ Property / cites work @@
+A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree
+Normal rank
@@ Property / cites work @@
+Improved Algorithms for Computing Minmax Regret 1-Sink and 2-Sink on Path Network
+Normal rank
@@ Property / cites work @@
+A linear time algorithm for computing minmax regret 1-median on a tree network
+Normal rank
@@ Property / cites work @@
+An O\((n\log n)\) version of the Averbakh-Berman algorithm for the robust median of a tree
+Normal rank
@@ Property / cites work @@
+Minmax-regret robust 1-median location on a tree
@@ Property / cites work: Minmax-regret robust 1-median location on a tree / rank @@
+Normal rank
@@ Property / cites work @@
+Minimax Regret 1-Sink Location Problems in Dynamic Path Networks
+Normal rank
@@ Property / cites work @@
+A note on the minmax regret centdian location on trees
+Normal rank
@@ Property / cites work @@
+Linear Time Algorithms for Two- and Three-Variable Linear Programs
+Normal rank
@@ Property / cites work @@
+Minimax regret 1-sink location problem in dynamic path networks
+Normal rank
@@ Property / cites work @@
+Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity
+Normal rank
@@ Property / cites work @@
+Multiple Sink Location Problems in Dynamic Path Networks
+Normal rank
@@ Property / cites work @@
+Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity
+Normal rank
@@ Property / cites work @@
+Multiple sink location problems in dynamic path networks
+Normal rank
@@ Property / cites work @@
+An \(O(n \log^2 n)\) algorithm for the optimal sink location problem in dynamic tree networks
+Normal rank
@@ Property / cites work @@
+Minmax Regret 1-Facility Location on Uncertain Path Networks
+Normal rank
@@ Property / cites work @@
+Minmax regret \(k\)-sink location on a dynamic path network with uniform capacities
+Normal rank
@@ Property / cites work @@
+Constructing Maximal Dynamic Flows from Static Flows
+Normal rank