On risk-averse maximum weighted subgraph problems
From MaRDI portal
Publication:405680
DOI10.1007/s10878-014-9718-0zbMath1304.90212OpenAlexW2055285298MaRDI QIDQ405680
Mohammad Mirghorbani, Maciej Rysz, Eduardo L. Pasiliao, Pavlo A. Krokhmal
Publication date: 5 September 2014
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-014-9718-0
coherent risk measuresmaximum weight clique problemrisk-averse maximum clique problemrisk-averse maximum weighted subgraph problemstochastic weights
Related Items
Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights, Detecting robust cliques in graphs subject to uncertain edge failures, Mining weighted subgraphs in a single large graph, Minimum cost flow problem with conflicts, Conditional value‐at‐risk beyond finance: a survey, A new branch-and-bound algorithm for the maximum edge-weighted clique problem, Exact solution algorithms for the maximum flow problem with additional conflict constraints, Sequential Monte Carlo for maximum weight subgraphs with application to solving image jigsaw puzzles, On the maximum small-world subgraph problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
- An exact algorithm for the maximum probabilistic clique problem
- Polynomial-time identification of robust network flows under uncertain arc failures
- An exact algorithm for the maximum clique problem
- Risk optimization with \(p\)-order conic constraints: a linear programming approach
- Robust solutions of uncertain linear programs
- A fast algorithm for the maximum weight clique problem
- The maximum clique problem
- A fast algorithm for the maximum clique problem
- Detecting robust cliques in graphs subject to uncertain edge failures
- The sample average approximation method applied to stochastic routing problems: a computational study
- Computational risk management techniques for fixed charge network flow problems with uncertain arc failures
- On \(p\)-norm linear discrimination
- Coherent Measures of Risk
- Technical Note—Approximation Algorithms for VRP with Stochastic Demands
- Polyhedral approximations inp-order cone programming
- Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs
- Two-Stage Robust Network Flow and Design Under Demand Uncertainty
- A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique
- On Importance of a Special Sorting in the Maximum-Weight Clique Algorithm Based on Colour Classes
- Finding a Maximum Clique in an Arbitrary Graph
- A Distributed Algorithm for Minimum-Weight Spanning Trees
- 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
