A tight upper bound for the \(k\)-partition problem on ideal sets (Q1306356)
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: A tight upper bound for the k-partition problem on ideal sets |
scientific article; zbMATH DE number 1347056
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A tight upper bound for the \(k\)-partition problem on ideal sets |
scientific article; zbMATH DE number 1347056 |
Statements
A tight upper bound for the \(k\)-partition problem on ideal sets (English)
0 references
4 March 2001
0 references
Lagrange multipliers
0 references
mathematical programming
0 references
NP-complete
0 references
scheduling theory
0 references
worst-case analysis
0 references
0.9335023760795592
0 references
0.9014424681663512
0 references
0.8559233546257019
0 references
