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

← Older edit

@@ aliases / en / 0 / aliases / en / 0 @@
+Minimax Regret 1-Median Problem in Dynamic Path Networks
@@ description / en / description / en @@
-scientific article
+scientific article; zbMATH DE number 6631016
@@ Property / title @@
+Minimax Regret 1-Median Problem in Dynamic Path Networks (English)
+Normal rank
@@ Property / zbMATH Open document ID @@
+.90235
@@ Property / zbMATH Open document ID: 1397.90235 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/978-3-319-44543-4_10
@@ Property / DOI: 10.1007/978-3-319-44543-4_10 / rank @@
+Normal rank
@@ Property / published in @@
+Lecture Notes in Computer Science
@@ Property / published in: Lecture Notes in Computer Science / rank @@
+Normal rank
@@ Property / publication date @@
+September 2016Timestamp +2016-09-29T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2016-09-29T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 29 September 2016 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6631016
@@ Property / zbMATH DE Number: 6631016 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2618272744
@@ Property / OpenAlex ID: W2618272744 / rank @@
+Normal rank
@@ 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

Latest revision as of 06: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