On the complexity of determining tolerances for ε-optimal solutions to min-max combinatorial optimization problems (Q4829385): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.4064/am30-3-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2099599157 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 23:10, 19 March 2024
scientific article; zbMATH DE number 2120086
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of determining tolerances for ε-optimal solutions to min-max combinatorial optimization problems |
scientific article; zbMATH DE number 2120086 |
Statements
On the complexity of determining tolerances for ε-optimal solutions to min-max combinatorial optimization problems (English)
0 references
29 November 2004
0 references
complexity
0 references
sensitivity analysis
0 references
min-max
0 references
0-1 combinatorial optimization problems
0 references
