Pages that link to "Item:Q4709729"

The following pages link to A branch and bound method for stochastic integer problems under probabilistic constraints (Q4709729):

Displaying 50 items.

• On the mixing set with a knapsack constraint (Q291057) (← links)
• Decomposition algorithms for two-stage chance-constrained programs (Q291060) (← links)
• Data-driven chance constrained stochastic program (Q304243) (← links)
• Using integer programming for balancing return and risk in problems with individual chance constraints (Q342012) (← links)
• Capital rationing problems under uncertainty and risk (Q429488) (← links)
• Mixed integer linear programming formulations for probabilistic constraints (Q439901) (← links)
• The stochastic capacitated branch restructuring problem (Q512982) (← links)
• A sampling-and-discarding approach to chance-constrained optimization: feasibility and Optimality (Q535064) (← links)
• Stochastic lot-sizing with backlogging: computational complexity analysis (Q537961) (← links)
• Easy distributions for combinatorial optimization problems with probabilistic constraints (Q614036) (← links)
• Uniform quasi-concavity in probabilistic constrained stochastic programming (Q635508) (← links)
• MIP reformulations of the probabilistic set covering problem (Q847820) (← links)
• An integer programming approach for linear programs with probabilistic constraints (Q847852) (← links)
• Solving chance-constrained combinatorial problems to optimality (Q967213) (← links)
• A joint chance-constrained programming approach for the single-item capacitated lot-sizing problem with stochastic demand (Q1639278) (← links)
• Relaxations and approximations of chance constraints under finite distributions (Q1650766) (← links)
• A polyhedral study on chance constrained program with random right-hand side (Q1683680) (← links)
• Single-item dynamic lot-sizing problems: an updated survey (Q1694825) (← links)
• A polyhedral study of the static probabilistic lot-sizing problem (Q1708524) (← links)
• Combining interval branch and bound and stochastic search (Q1725151) (← links)
• B\&B solution technique for multicriteria stochastic optimization problems (Q1797555) (← links)
• Designing robust emergency medical service via stochastic programming (Q1827657) (← links)
• Bounds for probabilistic integer programming problems (Q1850114) (← links)
• A finite branch-and-bound algorithm for two-stage stochastic integer programs (Q1881566) (← links)
• Lagrangian decomposition and mixed-integer quadratic programming reformulations for probabilistically constrained quadratic programs (Q1926817) (← 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)
• Chance-constrained sets approximation: a probabilistic scaling approach (Q2071956) (← links)
• Approximation of probabilistic constraints in stochastic programming problems with a probability measure kernel (Q2173180) (← links)
• Variable neighborhood search for a two-stage stochastic programming problem with a quantile criterion (Q2287157) (← links)
• The risk-averse traveling repairman problem with profits (Q2317622) (← links)
• Proportional and maxmin fairness for the sensor location problem with chance constraints (Q2414477) (← links)
• On mixing sets arising in chance-constrained programming (Q2429465) (← links)
• Genetic algorithm based technique for solving chance constrained problems (Q2464197) (← links)
• Beam search heuristic to solve stochastic integer problems under probabilistic constraints (Q2484339) (← links)
• Solving a class of stochastic mixed-integer programs with branch and price (Q2502208) (← links)
• A branch-reduce-cut algorithm for the global optimization of probabilistically constrained linear programs (Q2502217) (← links)
• A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem (Q2583144) (← links)
• The mixed capacitated general routing problem under uncertainty (Q2629641) (← links)
• A Branch-and-Price Algorithm for Multistage Stochastic Integer Programming with Application to Stochastic Batch-Sizing Problems (Q3114905) (← links)
• Enhancing a Branch-and-Bound Algorithm for Two-Stage Stochastic Integer Network Design-Based Models (Q3115997) (← links)
• A branch-and-bound method for multistage stochastic integer programs with risk objectives (Q3498593) (← links)
• A Polynomial Time Algorithm for the Stochastic Uncapacitated Lot-Sizing Problem with Backlogging (Q3503865) (← links)
• Tractable algorithms for chance-constrained combinatorial problems (Q3632807) (← links)
• BRANCH-AND-BOUND APPROACH FOR A STOCHASTIC PRODUCTION PLANNING PROBLEM WITH CAPACITY CONSTRAINTS (Q3818109) (← links)
• Stochastic Simulation on Integer Constraint Sets (Q4229472) (← links)
• A polynomial approximation-based approach for chance-constrained optimization (Q4646676) (← links)
• An Augmented Lagrangian Decomposition Method for Chance-Constrained Optimization Problems (Q5085476) (← links)
• Bicriteria Approximation of Chance-Constrained Covering Problems (Q5131473) (← links)
• (Q5184673) (← links)