Stochastic 0-1 linear programming under limited distributional information

Authors:
Michael R. Wagner
Affiliations:
Department of Management, California State University East Bay, Hayward, CA 94542, USA
Venue:
Operations Research Letters
Year:
2008

Citing 8
Cited 0

Stochastic bounds on distributions of optimal value functions with applications to PERT, network flows and reliability

Operations Research
A mathematical view of interior-point methods in convex optimization

A mathematical view of interior-point methods in convex optimization
Global Optimization with Polynomials and the Problem of Moments

SIAM Journal on Optimization
Bounds for probabilistic integer programming problems

Discrete Applied Mathematics - Workshop on discrete optimization DO'99, contributions to discrete optimization
The Probabilistic Set-Covering Problem

Operations Research
Probabilistic Combinatorial Optimization: Moments, Semidefinite Programming, and Asymptotic Bounds

SIAM Journal on Optimization
Optimal Inequalities in Probability Theory: A Convex Optimization Approach

SIAM Journal on Optimization
Dual decomposition in stochastic integer programming

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem min"X"@?"{"0","1"}"^"n{c^'x:a"j^'x=