Pages that link to "Item:Q2940540"

The following pages link to Covering Linear Programming with Violations (Q2940540):

Displaying 28 items.

• Decomposition algorithms for optimizing multi-server appointment scheduling with chance constraints (Q291063) (← links)
• A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support (Q403644) (← links)
• Nonanticipative duality, relaxations, and formulations for chance-constrained stochastic programs (Q517291) (← 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)
• On quantile cuts and their closure for chance constrained optimization problems (Q1801023) (← links)
• Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens (Q2089774) (← links)
• Special issue: Global solution of integer, stochastic and nonconvex optimization problems (Q2097627) (← links)
• Nonlinear chance-constrained problems with applications to hydro scheduling (Q2118083) (← links)
• On distributionally robust chance constrained programs with Wasserstein distance (Q2227531) (← links)
• A cutting plane method for risk-constrained traveling salesman problem with random arc costs (Q2274859) (← links)
• Optimizing over pure stationary equilibria in consensus stopping games (Q2281451) (← links)
• Approximation algorithms for the covering-type \(k\)-violation linear program (Q2329669) (← links)
• Arc routing under uncertainty: introduction and literature review (Q2669541) (← links)
• Chance-Constrained Binary Packing Problems (Q2940063) (← links)
• On the Quantile Cut Closure of Chance-Constrained Problems (Q3186519) (← links)
• Branch and Price for Chance-Constrained Bin Packing (Q3386782) (← links)
• Scenario Grouping and Decomposition Algorithms for Chance-Constrained Programs (Q4995100) (← links)
• ALSO-X and ALSO-X+: Better Convex Approximations for Chance Constrained Programs (Q5060524) (← links)
• Chance-Constrained Multiple Bin Packing Problem with an Application to Operating Room Planning (Q5084621) (← links)
• An Augmented Lagrangian Decomposition Method for Chance-Constrained Optimization Problems (Q5085476) (← links)
• Bicriteria Approximation of Chance-Constrained Covering Problems (Q5131473) (← links)
• Portfolio Optimization with Nonparametric Value at Risk: A Block Coordinate Descent Method (Q5136074) (← links)
• In Memoriam: Shabbir Ahmed (1969–2019) (Q5139620) (← links)
• On some extended mixed integer optimization models of the Eisenberg–Noe model in systemic risk management (Q6092540) (← links)
• Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness (Q6114933) (← links)
• A theoretical and computational analysis of full strong-branching (Q6126652) (← links)
• Efficient presolving methods for solving maximal covering and partial set covering location problems (Q6168589) (← links)