MIP reformulations of the probabilistic set covering problem
From MaRDI portal
Publication:847820
DOI10.1007/S10107-008-0224-YzbMATH Open1184.90116OpenAlexW2167201389MaRDI QIDQ847820FDOQ847820
Authors: Anureet Saxena, Vineet Goyal, Miguel A. Lejeune 
Publication date: 19 February 2010
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: http://edoc.hu-berlin.de/18452/9026
Recommendations
Stochastic programming (90C15) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Integer programming (90C10)
Cites Work
- An exact algorithm for the capacitated facility location problems with single sourcing
- Disjunctive programming: Properties of the convex hull of feasible points
- Optimizing over the first Chvátal closure
- Relaxations for probabilistically constrained programs with discrete random variables
- The Probabilistic Set-Covering Problem
- A branch and bound method for stochastic integer problems under probabilistic constraints
- Dual method for the solution of a one-stage stochastic programming problem with random RHS obeying a discrete probability distribution
- Concavity and efficient points of discrete distributions in probabilistic programming.
- The vertex separator problem: algorithms and computations
- An Efficient Trajectory Method for Probabilistic Production-Inventory-Distribution Problems
- Cyclic Scheduling via Integer Programs with Circular Ones
- Probabilistic Symmetries and Invariance Principles
- Optimizing over the split closure
- Title not available (Why is that?)
- Title not available (Why is that?)
- Balanced \(0,\pm 1\)-matrices, bicoloring and total dual integrality
Cited In (33)
- Algorithm to optimize the quantile criterion for the polyhedral loss function and discrete distribution of random parameters
- The Probabilistic Set-Covering Problem
- Cutting plane versus compact formulations for uncertain (integer) linear programs
- Mathematical programming approaches for generating \(p\)-efficient points
- A new approach for solving set covering problem using jumping particle swarm optimization method
- Title not available (Why is that?)
- A polyhedral study on chance constrained program with random right-hand side
- General properties of two-stage stochastic programming problems with probabilistic criteria
- Robust strategic planning for mobile medical units with steerable and unsteerable demands
- Title not available (Why is that?)
- Decomposition algorithms for two-stage chance-constrained programs
- Probabilistic partial set covering with an oracle for chance constraints
- A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support
- Reformulations in Mathematical Programming: Definitions and Systematics
- Mixed integer linear programming formulations for probabilistic constraints
- Branch-and-cut approaches for chance-constrained formulations of reliable network design problems
- Robust min-max regret covering problems
- Easy distributions for combinatorial optimization problems with probabilistic constraints
- An efficient computational method for large scale surgery scheduling problems with chance constraints
- An algorithm for binary linear chance-constrained problems using IIS
- Improved handling of uncertainty and robustness in set covering problems
- Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
- An exact method for constrained maximization of the conditional value-at-risk of a class of stochastic submodular functions
- Probabilistic set covering with correlations
- On mixing sets arising in chance-constrained programming
- Chance-constrained set covering with Wasserstein ambiguity
- An improved convex 0-1 quadratic program reformulation for chance-constrained quadratic knapsack problems
- Proportional and maxmin fairness for the sensor location problem with chance constraints
- Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness
- Chance-Constrained Binary Packing Problems
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
- Optimization models of anti-terrorist protection
Uses Software
This page was built for publication: MIP reformulations of the probabilistic set covering problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q847820)
