Covering linear programming with violations
From MaRDI portal
Recommendations
Cites work
- A Sample Approximation Approach for Optimization with Probabilistic Constraints
- A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support
- An integer programming and decomposition approach to general chance-constrained mathematical programs
- An integer programming approach for linear programs with probabilistic constraints
- Coefficient reduction for knapsack-like constraints in 0-1 programs with variable upper bounds
- Compact formulations as a union of polyhedra
- IIS branch-and-cut for joint chance-constrained stochastic programs and application to optimal vaccine allocation
- Low-Dimensional Linear Programming with Violations
- Mixing MIR inequalities with two divisible coefficients
- Mixing mixed-integer inequalities
- Models and algorithms for terrestrial digital broadcasting
- On mixing sets arising in chance-constrained programming
- Optimal vaccination strategies for a community of households
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Sample average approximation method for chance constrained programming: Theory and applications
- Sequential pairing of mixed integer inequalities
- Solving Large-Scale Zero-One Linear Programming Problems
- Strong valid inequalities for fluence map optimization problem under dose-volume restrictions
- The complexity and approximability of finding maximum feasible subsystems of linear relations
- The mixed vertex packing problem.
- The mixing-MIR set with divisible capacities
- Tight formulations for some simple mixed integer programs and convex objective integer programs
- Writing global optimization software
- k-violation linear programming
Cited in
(36)- Portfolio Optimization with Nonparametric Value at Risk: A Block Coordinate Descent Method
- A theoretical and computational analysis of full strong-branching
- Special issue: Global solution of integer, stochastic and nonconvex optimization problems
- Approximation algorithms for the covering-type \(k\)-violation linear program
- Scenario Grouping and Decomposition Algorithms for Chance-Constrained Programs
- On some extended mixed integer optimization models of the Eisenberg–Noe model in systemic risk management
- An Augmented Lagrangian Decomposition Method for Chance-Constrained Optimization Problems
- In Memoriam: Shabbir Ahmed (1969–2019)
- An adaptive partition-based approach for solving two-stage stochastic programs with fixed recourse
- Benders decomposition for bi-objective linear programs
- Nonlinear chance-constrained problems with applications to hydro scheduling
- A polyhedral study on chance constrained program with random right-hand side
- Branch and Price for Chance-Constrained Bin Packing
- On quantile cuts and their closure for chance constrained optimization problems
- Low-Dimensional Linear Programming with Violations
- Scalable algorithms for the sparse ridge regression
- A sequential algorithm for solving nonlinear optimization problems with chance constraints
- Bicriteria approximation of chance-constrained covering problems
- Decomposition algorithms for optimizing multi-server appointment scheduling with chance constraints
- A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support
- Adaptive partitioning for chance-constrained problems with finite support
- Nonanticipative duality, relaxations, and formulations for chance-constrained stochastic programs
- Efficient presolving methods for solving maximal covering and partial set covering location problems
- On distributionally robust chance constrained programs with Wasserstein distance
- Algorithms – ESA 2004
- Relaxations and approximations of chance constraints under finite distributions
- On the quantile cut closure of chance-constrained problems
- Distributionally robust optimization problem with probabilistic envelope constraints over Wasserstein ball
- A cutting plane method for risk-constrained traveling salesman problem with random arc costs
- Arc routing under uncertainty: introduction and literature review
- Optimizing over pure stationary equilibria in consensus stopping games
- Chance-Constrained Binary Packing Problems
- Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness
- Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens
- ALSO-X and ALSO-X+: Better Convex Approximations for Chance Constrained Programs
- Chance-Constrained Multiple Bin Packing Problem with an Application to Operating Room Planning
This page was built for publication: Covering linear programming with violations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2940540)
