On the Complexity of Minimizing the Total Calibration Cost (Q4632198): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Speed is as powerful as clairvoyance / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Worst-case analysis of greedy algorithms for the unbounded knapsack, subset-sum and partition problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal time-critical scheduling via resource augmentation / rank | |||
Normal rank | |||
Latest revision as of 01:26, 19 July 2024
scientific article; zbMATH DE number 7048095
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Complexity of Minimizing the Total Calibration Cost |
scientific article; zbMATH DE number 7048095 |
Statements
On the Complexity of Minimizing the Total Calibration Cost (English)
0 references
26 April 2019
0 references
0 references
