Approximation of min-max and min-max regret versions of some combinatorial optimization problems (Q858438): 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.ejor.2006.03.023 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2071335627 / rank | |||
Normal rank | |||
Revision as of 21:19, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation of min-max and min-max regret versions of some combinatorial optimization problems |
scientific article |
Statements
Approximation of min-max and min-max regret versions of some combinatorial optimization problems (English)
0 references
9 January 2007
0 references
min-max
0 references
min-max regret
0 references
approximation
0 references
fptas
0 references
shortest path
0 references
minimum spanning tree
0 references
Knapsack
0 references
