Extremal Probability Bounds in Combinatorial Optimization
From MaRDI portal
Publication:5051383
DOI10.1137/21M1442504OpenAlexW3197254574MaRDI QIDQ5051383
Unnamed Author, Karthik Natarajan, Divya Padmanabhan, Selin Damla Ahipaşaoğlu
Publication date: 23 November 2022
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2109.01591
Linear programming (90C05) Stochastic programming (90C15) Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bounds for functions of dependent risks
- Correlation polytopes: Their geometry and complexity
- Poisson approximation for dependent trials
- Das maximale Signifikanzniveau des Tests: Lehne \(H_0\) ab, wenn \(k\) unter \(n\) gegebenen Tests zur Ablehnung führen
- Geometric algorithms and combinatorial optimization.
- Poisson approximation and the Chen-Stein method. With comments and a rejoinder by the authors
- Bounds for the sum of dependent risks and worst value-at-risk with monotone marginal densities
- On distribution tail of the maximum of a random walk
- A distributionally robust analysis of the program evaluation and review technique
- Optimized Bonferroni approximations of distributionally robust joint chance constraints
- Poisson approximation
- Computation of sharp bounds on the distribution of a function of dependent risks
- Computing best-possible bounds for the distribution of a sum of several variables is NP-hard
- An approximation theorem for the Poisson binomial distribution
- On the Complexity of Nonoverlapping Multivariate Marginal Bounds for Probabilistic Combinatorial Optimization Problems
- Mathematical Risk Analysis
- Asymptotic Bounds for the Distribution of the Sum of Dependent Random Variables
- Joint Mixability
- Convex majorization with an application to the length of critical paths
- On Uniform Approximation of the Binomial Distribution by Infinitely Divisible Laws
- Bounding the Project Completion Time Distribution in PERT Networks
- Stochastic Bounds on Distributions of Optimal Value Functions with Applications to PERT, Network Flows and Reliability
- Random variables with maximum sums
- Estimates for the Distribution Function of a Sum of Two Random Variables When the Marginal Distributions are Fixed
- Polynomial algorithms for estimating network reliability
- Risk Theory in a Periodic Environment: The Cramér-Lundberg Approximation and Lundberg's Inequality
- Allocating Bandwidth for Bursty Connections
- Ambiguous Joint Chance Constraints Under Mean and Dispersion Information
- Probabilistic Combinatorial Optimization: Moments, Semidefinite Programming, and Asymptotic Bounds
- Bounds on Expected Project Tardiness
- Expected Critical Path Lengths in PERT Networks
- Best Possible Inequalities for the Probability of a Logical Function of Events
- A Statistical Theory for Pert in Which Completion Times of Activities are Inter-Dependent
- Bounding Distributions for a Stochastic Acyclic Network
- On the Maximum Partial Sums of Sequences of Independent Random Variables
