Bridging \(k\)-sum and CVaR optimization in MILP (Q1722975)
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: Bridging k-sum and CVaR optimization in MILP |
scientific article; zbMATH DE number 7024946
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bridging \(k\)-sum and CVaR optimization in MILP |
scientific article; zbMATH DE number 7024946 |
Statements
Bridging \(k\)-sum and CVaR optimization in MILP (English)
0 references
19 February 2019
0 references
integer programming
0 references
\(k\)-sum optimization
0 references
minimax/maximin
0 references
inequality
0 references
fairness
0 references
equitability
0 references
conditional value-at-risk
0 references
0 references
