Project scheduling with irregular costs: complexity, approximability, and algorithms (Q707495)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Project scheduling with irregular costs: complexity, approximability, and algorithms |
scientific article; zbMATH DE number 2133163
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Project scheduling with irregular costs: complexity, approximability, and algorithms |
scientific article; zbMATH DE number 2133163 |
Statements
Project scheduling with irregular costs: complexity, approximability, and algorithms (English)
0 references
9 February 2005
0 references
discrete time-cost tradeoff problem
0 references
NP-hard
0 references
APX-hard
0 references
0.8896142840385437
0 references
0.8482419848442078
0 references
0.8482419848442078
0 references
0.8197911977767944
0 references
