Pages that link to "Item:Q291067"

The following pages link to Robust optimization approach for a chance-constrained binary knapsack problem (Q291067):

Displaying 16 items.

• A robust approach to the chance-constrained knapsack problem (Q957372) (← links)
• Robust optimization for non-linear impact of data variation (Q1654345) (← links)
• Lifting of probabilistic cover inequalities (Q1728321) (← links)
• Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty (Q2125227) (← links)
• A robust optimization approach with probe-able uncertainty (Q2239954) (← 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)
• A fully polynomial time approximation scheme for the probability maximizing shortest path problem (Q2670558) (← links)
• Convexity and solutions of stochastic multidimensional 0-1 knapsack problems with probabilistic constraints (Q2806828) (← links)
• Tractable algorithms for chance-constrained combinatorial problems (Q3632807) (← links)
• (Q3795487) (← links)
• Binary knapsack problems with random budgets (Q4661177) (← 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)
• Robust integrated planning for LEO satellite network design and service operations (Q6556179) (← links)