Detecting large risk-averse 2-clubs in graphs with random edge failures

DOI10.1007/S10479-016-2279-0MaRDI QIDQ513610zbMATH OpenOpenAlexFDO

Authors F. Mahdavi Pajouh, Esmaeel Moradi, B. Balasundaram

Publication date 7 March 2017

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

Full work available at URL https://doi.org/10.1007/s10479-016-2279-0

zbMATH Keywords

conditional value-at-risk2-clubbenders decompositiongraph-based data mining

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Stochastic network models in operations research (90B15)

Recommendations

• scientific article; zbMATH DE number 7059787
• Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights
• Detecting robust cliques in graphs subject to uncertain edge failures
• On risk-averse maximum weighted subgraph problems
• On biconnected and fragile subgraphs of low diameter

Cites work

• L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
• An exact algorithm for the maximum \(k\)-club problem in an undirected graph
• CVaR norm and applications in optimization
• Coherent measures of risk
• Complex graphs and networks
• Computational aspects of minimizing conditional value-at-risk
• Conditional value at risk and related linear programming models for portfolio optimization
• Conditional value-at-risk in stochastic programs with mixed-integer recourse
• Convexity and decomposition of mean-risk stochastic programs
• Credit risk optimization with conditional Value-at-Risk criterion
• Detecting robust cliques in graphs subject to uncertain edge failures
• Dynamic conditional value-at-risk model for routing and scheduling of hazardous material transportation networks
• Handling CVaR objectives and constraints in two-stage stochastic models
• Integrated chance constraints: reduced forms and an algorithm
• Iterative estimation maximization for stochastic linear programs with conditional value-at-risk constraints
• Mining market data: a network approach
• Novel approaches for analyzing biological networks
• On clique relaxation models in network analysis
• On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs
• Optimization of discrete broadcast under uncertainty using conditional value-at-risk
• Partitioning procedures for solving mixed-variables programming problems
• Portfolio optimization by minimizing conditional value-at-risk via nondifferentiable optimization
• Reverse logistics network design and planning utilizing conditional value at risk
• The minimum spanning \(k\)-core problem with bounded CVaR under probabilistic edge failures

Cited in

(6)

• On risk-averse maximum weighted subgraph problems
• Detecting robust cliques in graphs subject to uncertain edge failures
• Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights
• Conditional value‐at‐risk beyond finance: a survey
• Efficient branch-and-bound algorithms for finding triangle-constrained 2-clubs
• scientific article; zbMATH DE number 7059787 (Why is no real title available?)

This page was built for publication: Detecting large risk-averse 2-clubs in graphs with random edge failures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q513610)