Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property (Q1341403): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 14:25, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property |
scientific article |
Statements
Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property (English)
0 references
11 January 1995
0 references
tower of sets
0 references
processing time
0 references
release date
0 references
due date
0 references
Moore-Hodgson algorithm
0 references
knapsack-like problem
0 references
nested inequality constraints
0 references
