Easy distributions for combinatorial optimization problems with probabilistic constraints

DOI10.1016/J.ORL.2010.09.005MaRDI QIDQ614036zbMATH OpenOpenAlexFDO

Authors Bernard Fortz, Michael Poss

Publication date 23 December 2010

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.orl.2010.09.005

zbMATH Keywords

combinatorial optimizationstochastic programmingprobabilistic constraint

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Stochastic programming (90C15)

Recommendations

• Optimization models with probabilistic constraints
• Structural properties of linear probabilistic constraints
• A Sample Approximation Approach for Optimization with Probabilistic Constraints
• scientific article; zbMATH DE number 98646
• scientific article; zbMATH DE number 124612

Cites work

• scientific article; zbMATH DE number 1803764 (Why is no real title available?)
• scientific article; zbMATH DE number 1161555 (Why is no real title available?)
• scientific article; zbMATH DE number 2121076 (Why is no real title available?)
• scientific article; zbMATH DE number 772850 (Why is no real title available?)
• A Sample Approximation Approach for Optimization with Probabilistic Constraints
• A Stochastic Programming Model
• A branch and bound method for stochastic integer problems under probabilistic constraints
• A probabilistic model applied to emergency service vehicle location
• Algorithms and Software for Convex Mixed Integer Nonlinear Programs
• An Efficient Trajectory Method for Probabilistic Production-Inventory-Distribution Problems
• An Integer Programming Approach to the Bandwidth Packing Problem
• An exact approach for solving integer problems under probabilistic constraints with random technology matrix
• Beam search heuristic to solve stochastic integer problems under probabilistic constraints
• Bounds for probabilistic integer programming problems
• Convexity of chance constraints with independent random variables
• Cover inequalities for robust knapsack sets -- application to the robust bandwidth packing problem
• Dual method for the solution of a one-stage stochastic programming problem with random RHS obeying a discrete probability distribution
• Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem
• Lectures on Stochastic Programming
• MIP reformulations of the probabilistic set covering problem
• On distributionally robust chance-constrained linear programs
• Provisioning virtual private networks under traffic uncertainty
• Review of nonlinear mixed-integer and disjunctive programming techniques
• Sample average approximation method for chance constrained programming: Theory and applications
• Solving chance-constrained combinatorial problems to optimality
• Telecommunication network capacity design for uncertain demand
• The Probabilistic Set-Covering Problem

Cited in

(2)

• Convexity and solutions of stochastic multidimensional 0-1 knapsack problems with probabilistic constraints
• The mixed capacitated general routing problem under uncertainty

This page was built for publication: Easy distributions for combinatorial optimization problems with probabilistic constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q614036)