Easy distributions for combinatorial optimization problems with probabilistic constraints

DOI10.1016/J.ORL.2010.09.005zbMATH Open1202.90224OpenAlexW1970608397MaRDI QIDQ614036FDOQ614036

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

Recommendations

• Optimization models with probabilistic constraints
• Structural properties of linear probabilistic constraints
• A Sample Approximation Approach for Optimization with Probabilistic Constraints
• scientific article
• scientific article

zbMATH Keywords

combinatorial optimizationstochastic programmingprobabilistic constraint

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (2)

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

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)