On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems (Q2503352): Difference between revisions
From MaRDI portal
Latest revision as of 20:24, 24 June 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
0 references
0 references
0 references
0 references
0 references
0 references