An approximation algorithm for interval data minmax regret combinatorial optimization problems (Q1045926): 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.1016/j.ipl.2005.11.001 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2051407192 / rank | |||
Normal rank | |||
Revision as of 03:22, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An approximation algorithm for interval data minmax regret combinatorial optimization problems |
scientific article |
Statements
An approximation algorithm for interval data minmax regret combinatorial optimization problems (English)
0 references
18 December 2009
0 references
robust optimization
0 references
maximal regret
0 references
approximation algorithms
0 references
combinatorial optimization
0 references
