MIP reformulations of the probabilistic set covering problem

DOI10.1007/s10107-008-0224-yzbMath1184.90116MaRDI QIDQ847820

Miguel A. Lejeune, Vineet Goyal, Anureet Saxena

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

zbMATH Keywords

Cutting planes; Set covering; Probabilistic programming

Mathematics Subject Classification ID

90C10: Integer programming

90C15: Stochastic programming

90-08: Computational methods for problems pertaining to operations research and mathematical programming

Related Items

Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs, Reformulations in Mathematical Programming: Definitions and Systematics

Uses Software

• OR-Library
• PORTA
• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Optimizing over the first Chvátal closure
• An exact algorithm for the capacitated facility location problems with single sourcing
• Relaxations for probabilistically constrained programs with discrete random variables
• Disjunctive programming: Properties of the convex hull of feasible points
• Balanced \(0,\pm 1\)-matrices, bicoloring and total dual integrality
• Optimizing over the split closure
• The vertex separator problem: algorithms and computations
• An Efficient Trajectory Method for Probabilistic Production-Inventory-Distribution Problems
• The Probabilistic Set-Covering Problem
• Cyclic Scheduling via Integer Programs with Circular Ones
• 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
• Probabilistic Symmetries and Invariance Principles
• Concavity and efficient points of discrete distributions in probabilistic programming.