Pages that link to "Item:Q1396210"

The following pages link to Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra (Q1396210):

Displaying 50 items.

• On the mixing set with a knapsack constraint (Q291057) (← links)
• Decomposition algorithms for two-stage chance-constrained programs (Q291060) (← links)
• New reformulations for probabilistically constrained quadratic programs (Q296982) (← links)
• Data-driven chance constrained stochastic program (Q304243) (← links)
• A purely proactive scheduling procedure for the resource-constrained project scheduling problem with stochastic activity durations (Q309061) (← links)
• Random-payoff two-person zero-sum game with joint chance constraints (Q322869) (← links)
• Multi-objective probabilistically constrained programs with variable risk: models for multi-portfolio financial optimization (Q322926) (← links)
• Using integer programming for balancing return and risk in problems with individual chance constraints (Q342012) (← links)
• A pure proactive scheduling algorithm for multiple Earth observation satellites under uncertainties of clouds (Q342441) (← links)
• A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support (Q403644) (← links)
• Capital rationing problems under uncertainty and risk (Q429488) (← links)
• Mixed integer linear programming formulations for probabilistic constraints (Q439901) (← links)
• On reducing a quantile optimization problem with discrete distribution to a mixed integer programming problem (Q462008) (← links)
• Threshold Boolean form for joint probabilistic constraints with random technology matrix (Q463738) (← links)
• A sampling-and-discarding approach to chance-constrained optimization: feasibility and Optimality (Q535064) (← links)
• Progressive hedging innovations for a class of stochastic mixed-integer resource allocation problems (Q645501) (← links)
• Branch-and-cut approaches for chance-constrained formulations of reliable network design problems (Q744205) (← links)
• A sparse chance constrained portfolio selection model with multiple constraints (Q785634) (← links)
• An integer programming approach for linear programs with probabilistic constraints (Q847852) (← links)
• An improved test set approach to nonlinear integer problems with applications to engineering design (Q887181) (← links)
• IIS branch-and-cut for joint chance-constrained stochastic programs and application to optimal vaccine allocation (Q992606) (← links)
• Mathematical programming approaches for generating \(p\)-efficient points (Q992653) (← links)
• On the convergence of sample approximations for stochastic programming problems with probabilistic criteria (Q1642031) (← links)
• Probabilistic optimization via approximate \(p\)-efficient points and bundle methods (Q1652036) (← links)
• Chance-constrained stochastic programming under variable reliability levels with an application to humanitarian relief network design (Q1652658) (← links)
• A long-term capacity expansion planning model for an electric power system integrating large-size renewable energy technologies (Q1652682) (← links)
• A polyhedral study on chance constrained program with random right-hand side (Q1683680) (← links)
• A polyhedral study of the static probabilistic lot-sizing problem (Q1708524) (← links)
• BBPH: using progressive hedging within branch and bound to solve multi-stage stochastic mixed integer programs (Q1727944) (← links)
• Optimization models of anti-terrorist protection (Q1735316) (← links)
• Convergence conditions for the observed mean method in stochastic programming (Q1745693) (← links)
• Cell-and-bound algorithm for chance constrained programs with discrete distributions (Q1753452) (← links)
• Lagrangian decomposition and mixed-integer quadratic programming reformulations for probabilistically constrained quadratic programs (Q1926817) (← links)
• Pattern definition of the \(p\)-efficiency concept (Q1931642) (← links)
• Augmented Lagrangian method for probabilistic optimization (Q1931647) (← links)
• An exact approach for solving integer problems under probabilistic constraints with random technology matrix (Q1958623) (← links)
• A progressive hedging based branch-and-bound algorithm for mixed-integer stochastic programs (Q1989733) (← links)
• A fractional stochastic integer programming problem for reliability-to-stability ratio in forest harvesting (Q1989738) (← links)
• Bounds for probabilistic programming with application to a blend planning problem (Q2060407) (← links)
• Stage-\(t\) scenario dominance for risk-averse multi-stage stochastic mixed-integer programs (Q2069234) (← links)
• Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens (Q2089774) (← links)
• Distributionally robust chance-constrained programs with right-hand side uncertainty under Wasserstein ambiguity (Q2097654) (← links)
• Problem-based optimal scenario generation and reduction in stochastic programming (Q2118075) (← links)
• Data-driven project portfolio selection: decision-dependent stochastic programming formulations with reliability and time to market requirements (Q2147012) (← links)
• Stochastic optimization models of actuarial mathematics (Q2215270) (← links)
• Algorithm to optimize the quantile criterion for the polyhedral loss function and discrete distribution of random parameters (Q2261687) (← links)
• Reducing two-stage probabilistic optimization problems with discrete distribution of random data to mixed-integer programming problems (Q2263338) (← links)
• Variable neighborhood search for a two-stage stochastic programming problem with a quantile criterion (Q2287157) (← links)
• General properties of two-stage stochastic programming problems with probabilistic criteria (Q2290416) (← links)
• A linear programming approach for linear programs with probabilistic constraints (Q2356018) (← links)