On risk-averse maximum weighted subgraph problems
DOI10.1007/S10878-014-9718-0zbMATH Open1304.90212OpenAlexW2055285298MaRDI QIDQ405680FDOQ405680
Authors: Maciej Rysz, Mohammad Mirghorbani, 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
Recommendations
coherent risk measuresmaximum weight clique problemrisk-averse maximum clique problemrisk-averse maximum weighted subgraph problemstochastic weights
Cites Work
- An improved branch and bound algorithm for the maximum clique problem
- Coherent measures of risk
- The maximum clique problem
- Title not available (Why is that?)
- Robust solutions of uncertain linear programs
- Polyhedral approximations in \(p\)-order cone programming
- Higher moment coherent risk measures
- A fast algorithm for the maximum clique problem
- Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
- Node-and edge-deletion NP-complete problems
- Risk optimization with \(p\)-order conic constraints: a linear programming approach
- The sample average approximation method applied to stochastic routing problems: a computational study
- 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
- Title not available (Why is that?)
- A fast algorithm for the maximum weight clique problem
- Title not available (Why is that?)
- An exact algorithm for the maximum clique problem
- Computational risk management techniques for fixed charge network flow problems with uncertain arc failures
- Maximizing residual flow under an arc destruction
- Two-Stage Robust Network Flow and Design Under Demand Uncertainty
- A simple and faster branch-and-bound algorithm for finding a maximum clique
- Polynomial-time identification of robust network flows under uncertain arc failures
- Detecting robust cliques in graphs subject to uncertain edge failures
- On \(p\)-norm linear discrimination
- Approximation algorithms for VRP with stochastic demands
- Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs
- On Importance of a Special Sorting in the Maximum-Weight Clique Algorithm Based on Colour Classes
- An exact algorithm for the maximum probabilistic clique problem
Cited In (12)
- Exact solution algorithms for the maximum flow problem with additional conflict constraints
- On the maximum small-world subgraph problem
- A new branch-and-bound algorithm for the maximum edge-weighted clique problem
- Detecting robust cliques in graphs subject to uncertain edge failures
- Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights
- Minimum cost flow problem with conflicts
- Risk averse submodular utility maximization
- Conditional value‐at‐risk beyond finance: a survey
- Mining weighted subgraphs in a single large graph
- Sequential Monte Carlo for maximum weight subgraphs with application to solving image jigsaw puzzles
- Title not available (Why is that?)
- Detecting large risk-averse 2-clubs in graphs with random edge failures
Uses Software
This page was built for publication: On risk-averse maximum weighted subgraph problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q405680)
