Detecting resilient structures in stochastic networks: A two‐stage stochastic optimization approach
Copyright policy )Detecting resilient structures in stochastic networks: A two‐stage stochastic optimization approach
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
- National Research Council Sri Lanka
- National Institute for Nuclear Physics Italy
- United States Air Force Research Laboratory United States
maximum subgraph problem, stochastic graphs, Computer Networks and Communications, combinatorial branch-and-bound algorithm, Stochastic programming, two-stage stochastic optimization, Programming involving graphs or networks, resilience of subgraphs, stochastic maximum clique problem, Hardware and Architecture, Deterministic network models in operations research, Polyhedral combinatorics, branch-and-bound, branch-and-cut, Software, Information Systems
maximum subgraph problem, stochastic graphs, Computer Networks and Communications, combinatorial branch-and-bound algorithm, Stochastic programming, two-stage stochastic optimization, Programming involving graphs or networks, resilience of subgraphs, stochastic maximum clique problem, Hardware and Architecture, Deterministic network models in operations research, Polyhedral combinatorics, branch-and-bound, branch-and-cut, Software, Information Systems
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).8 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!