Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality (Q5448654): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-540-77566-9_24 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1578867221 / rank | |||
Normal rank | |||
Revision as of 01:41, 20 March 2024
scientific article; zbMATH DE number 5246001
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality |
scientific article; zbMATH DE number 5246001 |
Statements
Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality (English)
0 references
7 March 2008
0 references
Robust optimization
0 references
Interval data
0 references
Shortest path
0 references
Spanning tree
0 references
Bipartite perfect matching
0 references
