Minimax regret 1-median problem in dynamic path networks (Q726099): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| 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 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 |
|
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
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
0 references
0 references
