On risk-averse maximum weighted subgraph problems
type: Item
instance of: scholarly article
title: On risk-averse maximum weighted subgraph problems
zbMATH Open document ID: 1304.90212
author: Maciej Rysz
author: Mohammad Mirghorbani
author: Eduardo L. Pasiliao
author: Pavlo A. Krokhmal
published in: Journal of Combinatorial Optimization
publication date: 2014-09-05T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C15
zbMATH DE Number: 6340721
zbMATH Keywords: risk-averse maximum weighted subgraph problem
zbMATH Keywords: risk-averse maximum clique problem
zbMATH Keywords: maximum weight clique problem
zbMATH Keywords: stochastic weights
zbMATH Keywords: coherent risk measures
describes a project that uses: MaxCliqueDyn
MaRDI profile type: Publication
full work available at URL: s10878-014-9718-0
OpenAlex ID: W2055285298
cites work: Maximizing residual flow under an arc destruction
cites work: Coherent measures of risk
cites work: Two-Stage Robust Network Flow and Design Under Demand Uncertainty
cites work: A fast algorithm for the maximum weight clique problem
cites work: Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs
cites work: Finding a Maximum Clique in an Arbitrary Graph
cites work: Robust solutions of uncertain linear programs
cites work: Polynomial-time identification of robust network flows under uncertain arc failures
cites work: An exact algorithm for the maximum clique problem
cites work: Q4550909
cites work: Q3286850
cites work: A Distributed Algorithm for Minimum-Weight Spanning Trees
cites work: A Dynamic Network Flow Problem with Uncertain arc Capacities: Formulation and Problem Structure
cites work: Approximation algorithms for VRP with stochastic demands
cites work: An improved branch and bound algorithm for the maximum clique problem
cites work: Higher moment coherent risk measures
cites work: Risk optimization with \(p\)-order conic constraints: a linear programming approach
cites work: On Importance of a Special Sorting in the Maximum-Weight Clique Algorithm Based on Colour Classes
cites work: An exact algorithm for the maximum probabilistic clique problem
cites work: On \(p\)-norm linear discrimination
cites work: Q4547547
cites work: A fast algorithm for the maximum clique problem
cites work: The maximum clique problem
cites work: Computational risk management techniques for fixed charge network flow problems with uncertain arc failures
cites work: A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique
cites work: Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
cites work: The sample average approximation method applied to stochastic routing problems: a computational study
cites work: Polyhedral approximations inp-order cone programming
cites work: Node-and edge-deletion NP-complete problems
cites work: Detecting robust cliques in graphs subject to uncertain edge failures
DOI: 10.1007/S10878-014-9718-0
description: scientific article; zbMATH DE number 6340721