Minimax regret p-center location on a network with demand uncertainty (Q4228787): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q238090 |
Created claim: Wikidata QID (P12): Q127571311, #quickstatements; #temporary_batch_1722547657812 |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Oded Berman / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q127571311 / rank | |||
Normal rank | |||
Latest revision as of 22:32, 1 August 2024
scientific article; zbMATH DE number 1257119
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimax regret p-center location on a network with demand uncertainty |
scientific article; zbMATH DE number 1257119 |
Statements
Minimax regret p-center location on a network with demand uncertainty (English)
0 references
1 March 1999
0 references
robust optimization
0 references
\(p\)-center problems
0 references
polynomial algorithms
0 references
transportation network
0 references
