Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property (Q1341403): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0895-7177(94)90209-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1986168186 / rank | |||
Normal rank | |||
Revision as of 00:50, 20 March 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
