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

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
aliases / en / 0aliases / en / 0
 
Minimax Regret 1-Median Problem in Dynamic Path Networks
description / endescription / en
scientific article
scientific article; zbMATH DE number 6631016
Property / title
 
Minimax Regret 1-Median Problem in Dynamic Path Networks (English)
Property / title: Minimax Regret 1-Median Problem in Dynamic Path Networks (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1397.90235 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-319-44543-4_10 / rank
 
Normal rank
Property / published in
 
Property / published in: Lecture Notes in Computer Science / rank
 
Normal rank
Property / publication date
 
29 September 2016
Timestamp+2016-09-29T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 29 September 2016 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6631016 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2618272744 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1509.07600 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the robust 1-center problem on a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Algorithms for Computing Minmax Regret 1-Sink and 2-Sink on Path Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time algorithm for computing minmax regret 1-median on a tree network / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O\((n\log n)\) version of the Averbakh-Berman algorithm for the robust median of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minmax-regret robust 1-median location on a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimax Regret 1-Sink Location Problems in Dynamic Path Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the minmax regret centdian location on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Time Algorithms for Two- and Three-Variable Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimax regret 1-sink location problem in dynamic path networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple Sink Location Problems in Dynamic Path Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple sink location problems in dynamic path networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(n \log^2 n)\) algorithm for the optimal sink location problem in dynamic tree networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minmax Regret 1-Facility Location on Uncertain Path Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minmax regret \(k\)-sink location on a dynamic path network with uniform capacities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing Maximal Dynamic Flows from Static Flows / rank
 
Normal rank

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

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
3 August 2018
0 references
29 September 2016
0 references
minimax regret
0 references
sink location
0 references
dynamic flow
0 references
evacuation planning
0 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references