Pages that link to "Item:Q957372"

The following pages link to A robust approach to the chance-constrained knapsack problem (Q957372):

Displaying 32 items.

• Robust optimization approach for a chance-constrained binary knapsack problem (Q291067) (← links)
• Robust combinatorial optimization with variable cost uncertainty (Q296586) (← links)
• Exact solution of the robust knapsack problem (Q336592) (← links)
• Optimizing financial and physical assets with chance-constrained programming in the electrical industry (Q535690) (← links)
• On two-stage stochastic knapsack problems (Q643023) (← links)
• Solving chance-constrained combinatorial problems to optimality (Q967213) (← links)
• A PTAS for the chance-constrained knapsack problem with random item sizes (Q974983) (← links)
• Upper bounds for the 0-1 stochastic knapsack problem and a B\&B algorithm (Q993710) (← links)
• A shortest-path-based approach for the stochastic knapsack problem with non-decreasing expected overfilling costs (Q1652714) (← links)
• Robust combinatorial optimization with knapsack uncertainty (Q1662111) (← links)
• Lifting of probabilistic cover inequalities (Q1728321) (← links)
• Multipolar robust optimization (Q1731824) (← links)
• The resource constrained shortest path problem with uncertain data: a robust formulation and optimal solution approach (Q1738828) (← links)
• The multi-band robust knapsack problem -- a dynamic programming approach (Q1751135) (← links)
• Stochastic binary problems with simple penalties for capacity constraints violations (Q1949274) (← links)
• A branch and price approach for the robust bandwidth packing problem with queuing delays (Q2070728) (← links)
• Exact algorithms for the 0-1 time-bomb knapsack problem (Q2147139) (← links)
• A robust optimization approach with probe-able uncertainty (Q2239954) (← links)
• Complexity results and exact algorithms for robust knapsack problems (Q2247901) (← links)
• A note on upper bounds to the robust knapsack problem with discrete scenarios (Q2259050) (← links)
• Robust optimization-based heuristic algorithm for the chance-constrained knapsack problem using submodularity (Q2300641) (← links)
• Robust scheduling with budgeted uncertainty (Q2414457) (← links)
• Mathematical models and approximate solution approaches for the stochastic bin packing problem (Q2669539) (← links)
• A dynamic programming approach for a class of robust optimization problems (Q2817842) (← links)
• Cover inequalities for robust knapsack sets -- application to the robust bandwidth packing problem (Q2892146) (← links)
• Tractable algorithms for chance-constrained combinatorial problems (Q3632807) (← links)
• (Q3795487) (← links)
• The minmax multidimensional knapsack problem with application to a chance‐constrained problem (Q5438265) (← links)
• Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness (Q6114933) (← links)
• Comparative analysis of linear programming relaxations for the robust knapsack problem (Q6170571) (← links)
• A new sequential lifting of robust cover inequalities (Q6492454) (← links)
• A heuristic column generation approach for the stochastic bin packing problem (Q6606532) (← links)