An alternative approach for proving the NP-hardness of optimization problems (Q320621): 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.2015.06.076 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1478931920 / rank | |||
Normal rank | |||
Revision as of 22:37, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An alternative approach for proving the NP-hardness of optimization problems |
scientific article |
Statements
An alternative approach for proving the NP-hardness of optimization problems (English)
0 references
7 October 2016
0 references
combinatorial optimization
0 references
computational complexity
0 references
scheduling
0 references
