Solving knapsack sharing problems with general tradeoff functions (Q810377)
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: Solving knapsack sharing problems with general tradeoff functions |
scientific article; zbMATH DE number 4213755
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving knapsack sharing problems with general tradeoff functions |
scientific article; zbMATH DE number 4213755 |
Statements
Solving knapsack sharing problems with general tradeoff functions (English)
0 references
1991
0 references
maximin programming
0 references
multiple-valued objective functions
0 references
knapsack sharing problem
0 references
minimax mathematical programming
0 references
optimality conditions
0 references
continuous tradeoff function
0 references
staircase functions
0 references
ascending function
0 references
Polynomial algorithms
0 references
0.9213910102844238
0 references
0.9213910102844238
0 references
0.828349232673645
0 references
0.823067307472229
0 references
0.8218570351600647
0 references
