Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property (Q1341403)
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: Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property |
scientific article; zbMATH DE number 706950
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property |
scientific article; zbMATH DE number 706950 |
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
0 references
0 references
