MIP reformulations of the probabilistic set covering problem

Mathematical Programming

Volumn 121, Issue 1, 2010, Pages 1-31

  Saxena, Anureet ^a   Goyal, Vineet ^a   Lejeune, Miguel A ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b DREXEL UNIVERSITY   (United States)

Author keywords

Cutting planes; Mixed integer programming; Probabilistic programming; Set covering

Indexed keywords

0-1 VECTORS; COMPUTATIONAL EXPERIMENT; COMPUTATIONAL RESULTS; COMPUTING TIME; CUTTING PLANES; FACILITY LOCATIONS; K-MEDIAN; MATRIX; MIXED INTEGER PROGRAMMING; ORDERS OF MAGNITUDE; PROBABILISTIC PROGRAMMING; PROBABILISTIC VARIANT; SET COVERING; SET COVERING PROBLEM; SET-COVERING MODEL; STATIONARY DISTRIBUTION; THRESHOLD PROBABILITY; WAREHOUSE LOCATION;

DISTRIBUTION FUNCTIONS; DYNAMIC PROGRAMMING; PLASMA WAVES; TEST FACILITIES;

INTEGER PROGRAMMING;

EID: 67349234083     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-008-0224-y     Document Type: Article

References (25)

1. E. Balas 1998 Disjunctive programming, properties of the convex hull of feasible points Discret. Appl. Math. 89 1-3 3 44 (Pubitemid 128400151)
2. E. Balas A. Saxena 2008 Optimizing over the split closure Math. Program. Ser. A 113 2 219 240 (Pubitemid 351177970)
3. J.J.III Bartholdi J.B. Orlin H.D. Ratliff 1980 Cyclic scheduling via integer programs with circular ones Oper. Res. 28 1074 1085
4. Beasley, J.E.: OR-Library. http://www.people.brunel.ac.uk/~mastjjb/jeb/ info.html
5. P. Beraldi A. Ruszczyński 2002 The probabilistic set covering problem Oper. Res. 50 956 967
6. P. Beraldi A. Ruszczyński 2002 A branch and bound method for stochastic integer problems under probabilistic constraints Optim. Methods Softw. 17 3 359 382 (Pubitemid 35242089)
7. A. Charnes W.W. Cooper G.H. Symonds 1958 Cost horizons and certainty equivalents: an approach to stochastic programming of heating oil Manag. Sci. 4 235 263
8. Christof, T., Lobel, A.: PORTA - POlyhedron Representation Transformation Algorithm. http://www.zib.de/Optimization/Software/Porta/
9. COIN: Computational infrastructure for operations research. http://www.coin-or.org
10. G. Cornuejols M. Conforti 1995 Balanced 0,1,-1 Matrices, bicoloring and total dual integrality Math. Program. 71 249 258
11. Cornuejols, G.: Combinatorial Optimization: Packing and Covering. Published by SIAM (2001) in the CBMS-NSF Regional Conference Series in Applied Mathematics CBMS 74 (2000)
12. D. Dentcheva A. Prékopa A. Ruszczyński 2000 Concavity and efficient points of discrete distributions in probabilistic programming Math. Program. 89 55 77
13. A. Lodi M. Fischetti 2007 Optimizing over the first Chvátal closure Math. Program. 110 1 3 20 (Pubitemid 46411827)
14. K. Holmberg M. Ronnqvist D. Yuan 1999 An exact algorithm for the capacited facility location 517 problems with single sourcing Eur. J. Oper. Res. 113 544 559
15. Kallenberg O.: Probabilistic Symmetries and Invariance Principles. Springer, Heidelberg (2005)
16. M.A. Lejeune A. Ruszczyński 2007 An efficient method trajectory method for probabilistic inventory-production-distribution problems Oper. Res. 55 2 378 394 (Pubitemid 46663469)
17. Luedtke J., Ahmed S., Nemhauser G.: Strong MIP Formulations for Chance Constrained Linear Programs with Random Right-Hand Side. INFORMS Conference, Pittsburgh (2006)
18. A. Prékopa 1990 Dual method for a one-stage stochastic programming with random rhs obeying a discrete probability distribution Z. Oper. Res. 34 441 461
19. Prékopa A.: Stochastic Programming. Kluwer, Boston (1995)
20. Prékopa A.: Probabilistic programming models. In: Ruszczyński, A., Shapiro, A. (eds) Stochastic Programming: Handbook in Operations Research and Management Science, vol. 10, Chap. 5, pp. 267-351. Elsevier Science Ltd, Amsterdam (2003)
21. Prékopa A., Vizvari B., Badics T.: Programming under probabilistic constraint with discrete random variable. In: Giannessi, F., Komlósi, S., Rapcsák, T. (eds) New Trends in Mathematical Programming, MA, Boston (1998)
22. Saxena, A., Goyal, V., Lejeune, M.A.: MIP reformulations of the probabilistic set covering problem, Tepper Working Paper No. 2007-E3 (2007)
23. S. Sen 1992 Relaxations for probabilistically constrained programs with discrete random variables Oper. Res. Lett. 11 2 81 86
24. C. de Souza E. Balas 2005 The vertex separator problem: algorithms and computations Math. Program. 103 3 609 631 (Pubitemid 40925245)
25. Toth P., Vigo D.: Branch-and-bound algorithms for the capacitated VRP. In: Toth, P., Vigo, D. (eds) The Vehicle Routing Problem, pp. 29-52. SIAM, Philadelphia (2001)