Resource constrained assignment problems (Q1264090)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4128656
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Resource constrained assignment problems |
scientific article; zbMATH DE number 4128656 |
Statements
Resource constrained assignment problems (English)
0 references
1990
0 references
This paper studies the resource constrained assignment problem from a polyhedral approach. Several classes of valid inequalities based on the properties of the knapsack and assignment polytopes are derived.
0 references
resource constrained assignment
0 references
polyhedral approach
0 references
valid inequalities
0 references
0.9565766
0 references
0.93733835
0 references
0.91458267
0 references
0.90360725
0 references
0.89994276
0 references
