On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems (Q2503352): 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.tcs.2006.05.013 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2091666830 / rank | |||
Normal rank | |||
Revision as of 00:46, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems |
scientific article |
Statements
On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems (English)
0 references
14 September 2006
0 references
combinatorial lower bounds
0 references
LP-based lower bounds
0 references
scheduling
0 references
