Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights

DOI10.1007/s10479-016-2212-6zbMath1391.90616OpenAlexW2346300375MaRDI QIDQ1640044

Maciej Rysz, Foad Mahdavi Pajouh, Eduardo L. Pasiliao, Pavlo A. Krokhmal

Publication date: 13 June 2018

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-016-2212-6

zbMATH Keywords

coherent risk measures\(k\)-clubcombinatorial branch-and-boundstochastic graphslow-diameter clusters

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Stochastic programming (90C15) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)

Uses Software

• MaxCliqueDyn

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
• On risk-averse maximum weighted subgraph problems
• An integer programming framework for critical elements detection in graphs
• On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs
• Finding large \(k\)-clubs in undirected graphs
• An exact algorithm for the maximum clique problem
• Risk optimization with \(p\)-order conic constraints: a linear programming approach
• A fast algorithm for the maximum weight clique problem
• An exact algorithm for the maximum \(k\)-club problem in an undirected graph
• A fast algorithm for the maximum clique problem
• Parameterized computational complexity of finding small-diameter subgraphs
• On the maximum quasi-clique problem
• The sample average approximation method applied to stochastic routing problems: a computational study
• On \(p\)-norm linear discrimination
• Network-based marketing: identifying likely adopters via consumer networks
• Generalized deviations in risk analysis
• Mining market data: a network approach
• Novel approaches for analyzing biological networks
• Coherent Measures of Risk
• Technical Note—Approximation Algorithms for VRP with Stochastic Demands
• Polyhedral approximations inp-order cone programming
• Two-Stage Robust Network Flow and Design Under Demand Uncertainty
• A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique
• Finding a Maximum Clique in an Arbitrary Graph
• A graph‐theoretic definition of a sociometric clique†
• A graph‐theoretic generalization of the clique concept
• A Dynamic Network Flow Problem with Uncertain arc Capacities: Formulation and Problem Structure
• Maximizing residual flow under an arc destruction
• Node-and edge-deletion NP-complete problems
• Higher moment coherent risk measures

This page was built for publication: Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights