On risk-averse maximum weighted subgraph problems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3168330 (Why is no real title available?)
- scientific article; zbMATH DE number 1786225 (Why is no real title available?)
- scientific article; zbMATH DE number 1795842 (Why is no real title available?)
- A Distributed Algorithm for Minimum-Weight Spanning Trees
- A Dynamic Network Flow Problem with Uncertain arc Capacities: Formulation and Problem Structure
- A fast algorithm for the maximum clique problem
- A fast algorithm for the maximum weight clique problem
- A simple and faster branch-and-bound algorithm for finding a maximum clique
- Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
- An exact algorithm for the maximum clique problem
- An exact algorithm for the maximum probabilistic clique problem
- An improved branch and bound algorithm for the maximum clique problem
- Approximation algorithms for VRP with stochastic demands
- Coherent measures of risk
- Computational risk management techniques for fixed charge network flow problems with uncertain arc failures
- Detecting robust cliques in graphs subject to uncertain edge failures
- Finding a Maximum Clique in an Arbitrary Graph
- Higher moment coherent risk measures
- Maximizing residual flow under an arc destruction
- Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs
- Node-and edge-deletion NP-complete problems
- On Importance of a Special Sorting in the Maximum-Weight Clique Algorithm Based on Colour Classes
- On \(p\)-norm linear discrimination
- Polyhedral approximations in \(p\)-order cone programming
- Polynomial-time identification of robust network flows under uncertain arc failures
- Risk optimization with \(p\)-order conic constraints: a linear programming approach
- Robust solutions of uncertain linear programs
- The maximum clique problem
- The sample average approximation method applied to stochastic routing problems: a computational study
- Two-Stage Robust Network Flow and Design Under Demand Uncertainty
Cited in
(12)- A new branch-and-bound algorithm for the maximum edge-weighted clique problem
- Minimum cost flow problem with conflicts
- Mining weighted subgraphs in a single large graph
- Detecting robust cliques in graphs subject to uncertain edge failures
- scientific article; zbMATH DE number 7059787 (Why is no real title available?)
- Exact solution algorithms for the maximum flow problem with additional conflict constraints
- Detecting large risk-averse 2-clubs in graphs with random edge failures
- Sequential Monte Carlo for maximum weight subgraphs with application to solving image jigsaw puzzles
- Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights
- On the maximum small-world subgraph problem
- Risk averse submodular utility maximization
- Conditional value‐at‐risk beyond finance: a survey
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)
