Pinpointing the complexity of the interval min-max regret knapsack problem (Q429656): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.disopt.2010.03.008 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2094834697 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Robust discrete optimization and its applications / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Min-max and min-max regret versions of combinatorial optimization problems: A survey / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4298260 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The robust spanning tree problem with interval data / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The polynomial-time hierarchy / rank | |||
Normal rank | |||
Latest revision as of 09:37, 5 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Pinpointing the complexity of the interval min-max regret knapsack problem |
scientific article |
Statements
Pinpointing the complexity of the interval min-max regret knapsack problem (English)
0 references
20 June 2012
0 references
robust optimization
0 references
computational complexity
0 references
polynomial hierarchy
0 references
