Bridging k-sum and CVaR optimization in MILP
Copyright policy )Bridging k-sum and CVaR optimization in MILP
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
- Warsaw University of Technology Poland
- University of Brescia Italy
Combinatorial optimization, inequality, Integer programming, K-sum optimization, Minimax/Maximin, Inequality, Fairness, Equitability, Conditional Value-at-Risk, Stochastic programming, fairness, equitability, Programming involving graphs or networks, Mixed integer programming, minimax/maximin, conditional value-at-risk, Linear programming, \(k\)-sum optimization, integer programming
Combinatorial optimization, inequality, Integer programming, K-sum optimization, Minimax/Maximin, Inequality, Fairness, Equitability, Conditional Value-at-Risk, Stochastic programming, fairness, equitability, Programming involving graphs or networks, Mixed integer programming, minimax/maximin, conditional value-at-risk, Linear programming, \(k\)-sum optimization, integer programming
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).10 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
Citations provided by BIP!Popularity provided by BIP!