Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra
From MaRDI portal
Publication:1396210
DOI10.1007/s10107-002-0337-7zbMath1065.90058OpenAlexW1995670718WikidataQ90157555 ScholiaQ90157555MaRDI QIDQ1396210
Publication date: 2002
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-002-0337-7
Large-scale problems in mathematical programming (90C06) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Stochastic programming (90C15) Combinatorial optimization (90C27)
Related Items (75)
On the mixing set with a knapsack constraint ⋮ Decomposition algorithms for two-stage chance-constrained programs ⋮ New reformulations for probabilistically constrained quadratic programs ⋮ Scenario Min-Max Optimization and the Risk of Empirical Costs ⋮ Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support ⋮ Data-driven chance constrained stochastic program ⋮ A purely proactive scheduling procedure for the resource-constrained project scheduling problem with stochastic activity durations ⋮ A probabilistic model applied to emergency service vehicle location ⋮ An integer programming approach for linear programs with probabilistic constraints ⋮ On the convergence of sample approximations for stochastic programming problems with probabilistic criteria ⋮ Data-driven project portfolio selection: decision-dependent stochastic programming formulations with reliability and time to market requirements ⋮ ALSO-X and ALSO-X+: Better Convex Approximations for Chance Constrained Programs ⋮ Random-payoff two-person zero-sum game with joint chance constraints ⋮ Multi-objective probabilistically constrained programs with variable risk: models for multi-portfolio financial optimization ⋮ Probabilistic optimization via approximate \(p\)-efficient points and bundle methods ⋮ Chance-constrained stochastic programming under variable reliability levels with an application to humanitarian relief network design ⋮ A long-term capacity expansion planning model for an electric power system integrating large-size renewable energy technologies ⋮ Using integer programming for balancing return and risk in problems with individual chance constraints ⋮ A pure proactive scheduling algorithm for multiple Earth observation satellites under uncertainties of clouds ⋮ ON INTEGRATED CHANCE CONSTRAINTS IN ALM FOR PENSION FUNDS ⋮ Distributionally Robust Optimization with Principal Component Analysis ⋮ Chance-Constrained Multiple Bin Packing Problem with an Application to Operating Room Planning ⋮ An Augmented Lagrangian Decomposition Method for Chance-Constrained Optimization Problems ⋮ Building Load Control Using Distributionally Robust Chance-Constrained Programs with Right-Hand Side Uncertainty and the Risk-Adjustable Variants ⋮ Chance-Constrained Binary Packing Problems ⋮ Chance-Constrained Optimization of Reliable Fixed Broadband Wireless Networks ⋮ Lagrangian decomposition and mixed-integer quadratic programming reformulations for probabilistically constrained quadratic programs ⋮ An improved test set approach to nonlinear integer problems with applications to engineering design ⋮ A polyhedral study on chance constrained program with random right-hand side ⋮ Pattern definition of the \(p\)-efficiency concept ⋮ Augmented Lagrangian method for probabilistic optimization ⋮ A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support ⋮ Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness ⋮ Scenario-dominance to multi-stage stochastic lot-sizing and knapsack problems ⋮ On mixing sets arising in chance-constrained programming ⋮ Capital rationing problems under uncertainty and risk ⋮ Solving Chance-Constrained Problems via a Smooth Sample-Based Nonlinear Approximation ⋮ Mixed integer linear programming formulations for probabilistic constraints ⋮ A polyhedral study of the static probabilistic lot-sizing problem ⋮ Progressive hedging innovations for a class of stochastic mixed-integer resource allocation problems ⋮ An exact approach for solving integer problems under probabilistic constraints with random technology matrix ⋮ Stochastic optimization models of actuarial mathematics ⋮ A smooth non-parametric estimation framework for safety-first portfolio optimization ⋮ On reducing a quantile optimization problem with discrete distribution to a mixed integer programming problem ⋮ Threshold Boolean form for joint probabilistic constraints with random technology matrix ⋮ BBPH: using progressive hedging within branch and bound to solve multi-stage stochastic mixed integer programs ⋮ Probabilistic Partial Set Covering with an Oracle for Chance Constraints ⋮ Optimization models of anti-terrorist protection ⋮ Genetic algorithm based technique for solving chance constrained problems ⋮ Convergence conditions for the observed mean method in stochastic programming ⋮ A progressive hedging based branch-and-bound algorithm for mixed-integer stochastic programs ⋮ A fractional stochastic integer programming problem for reliability-to-stability ratio in forest harvesting ⋮ Cell-and-bound algorithm for chance constrained programs with discrete distributions ⋮ A sampling-and-discarding approach to chance-constrained optimization: feasibility and Optimality ⋮ Algorithm to optimize the quantile criterion for the polyhedral loss function and discrete distribution of random parameters ⋮ Reducing two-stage probabilistic optimization problems with discrete distribution of random data to mixed-integer programming problems ⋮ A branch-reduce-cut algorithm for the global optimization of probabilistically constrained linear programs ⋮ Fix and relax heuristic for a stochastic lot-sizing problem ⋮ IIS branch-and-cut for joint chance-constrained stochastic programs and application to optimal vaccine allocation ⋮ Mathematical programming approaches for generating \(p\)-efficient points ⋮ Variable neighborhood search for a two-stage stochastic programming problem with a quantile criterion ⋮ Robustness of optimal portfolios under risk and stochastic dominance constraints ⋮ General properties of two-stage stochastic programming problems with probabilistic criteria ⋮ Branch-and-cut approaches for chance-constrained formulations of reliable network design problems ⋮ Tractable algorithms for chance-constrained combinatorial problems ⋮ Bounds for probabilistic programming with application to a blend planning problem ⋮ Solving Chance-Constrained Optimization Problems with Stochastic Quadratic Inequalities ⋮ Stage-\(t\) scenario dominance for risk-averse multi-stage stochastic mixed-integer programs ⋮ AN IMPROVED CONVEX 0-1 QUADRATIC PROGRAM REFORMULATION FOR CHANCE-CONSTRAINED QUADRATIC KNAPSACK PROBLEMS ⋮ A sparse chance constrained portfolio selection model with multiple constraints ⋮ Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens ⋮ Distributionally robust chance-constrained programs with right-hand side uncertainty under Wasserstein ambiguity ⋮ Advances and applications of chance-constrained approaches to systems optimisation under uncertainty ⋮ A linear programming approach for linear programs with probabilistic constraints ⋮ Problem-based optimal scenario generation and reduction in stochastic programming
Uses Software
This page was built for publication: Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra
