On the complexity of nonoverlapping multivariate marginal bounds for probabilistic combinatorial optimization problems
type: Item
instance of: scholarly article
zbMATH Open document ID: 1245.90099
author: Xuan Vinh Doan
author: Karthik Natarajan
published in: Operations Research
publication date: 2012-06-18T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C15
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 6047331
zbMATH Keywords: probability bounds
zbMATH Keywords: PERT
MaRDI profile type: Publication
full work available at URL: opre.1110.1005
OpenAlex ID: W2111697309
DOI: 10.1287/OPRE.1110.1005
Recommended article: Probabilistic Combinatorial Optimization: Moments, Semidefinite Programming, and Asymptotic Bounds
Recommended article: Extremal Probability Bounds in Combinatorial Optimization
Recommended article: Probabilistic asymptotic properties of some combinatorial optimization problems
Recommended article: Bounds for probabilistic integer programming problems
Recommended article: Probabilistic bounds and algorithms for the maximum satisfiability problem
Recommended article: On the complexity of a class of combinatorial optimization problems with uncertainty
Recommended article: Approximation algorithms for stochastic combinatorial optimization problems
Recommended article: Randomized approximation of bounded multicovering problems
Recommended article: Q3707402
title: On the complexity of nonoverlapping multivariate marginal bounds for probabilistic combinatorial optimization problems
description: scientific article; zbMATH DE number 6047331