Bridging \(k\)-sum and CVaR optimization in MILP
type: Item
instance of: scholarly article
title: Bridging \(k\)-sum and CVaR optimization in MILP
zbMATH Open document ID: 1458.90483
author: Carlo Filippi
author: W. Ogryczak
author: Maria Grazia Speranza
published in: Computers \& Operations Research
publication date: 2019-02-19T00:00:00Z
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C15
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 7024946
zbMATH Keywords: integer programming
zbMATH Keywords: \(k\)-sum optimization
zbMATH Keywords: minimax/maximin
zbMATH Keywords: inequality
zbMATH Keywords: fairness
zbMATH Keywords: equitability
zbMATH Keywords: conditional value-at-risk
describes a project that uses: OR-Library
MaRDI profile type: Publication
full work available at URL: j.cor.2019.01.010
OpenAlex ID: W2911648154
cites work: k-Eccentricity and absolute k-centrum of a probabilistic tree
cites work: Properties of thek-centra in a tree network
cites work: Coherent measures of risk
cites work: The Price of Robustness
cites work: Constructing Uncertainty Sets for Robust Linear Optimization
cites work: A genetic algorithm for the multidimensional knapsack problem
cites work: Q4532026
cites work: The partial sum criterion for Steiner trees in graphs and shortest paths
cites work: The \(k\)-centrum shortest path problem
cites work: Q3953561
cites work: On the effectiveness of scenario generation techniques in single-period portfolio optimization
cites work: k-sum optimization problems
cites work: Finding Minimal Center-Median Convex Combination (Cent-Dian) of a Graph
cites work: Q5444109
cites work: Q4821303
cites work: Equitable aggregations and multiple criteria analysis
cites work: Computational aspects of minimizing conditional value-at-risk
cites work: Inequalities: theory of majorization and its applications
cites work: Location Theory
cites work: Tail mean and related robust solution concepts
cites work: Fair optimization and networks: a survey
cites work: On solving linear programs with the ordered weighted averaging objective.
cites work: Minimizing the sum of the \(k\) largest functions in linear time.
cites work: Scheduling
cites work: Revisiting \(k\)-sum optimization
cites work: Locating tree-shaped facilities using the ordered median objective
cites work: K-Sum Linear Programming
cites work: On \(k\)-sum optimization
cites work: Minimizing conditional-value-at-risk for stochastic scheduling problems
cites work: Centers to centroids in graphs
cites work: The \(k\)-centrum multi-facility location problem
cites work: Q5800557
cites work: On minimizing the sum of \(k\) tardinesses
DOI: 10.1016/J.COR.2019.01.010
description: scientific article; zbMATH DE number 7024946