Covering Linear Programming with Violations

References

• Ahmed S, Garcia R, Kong N, Ntaimo L, Parija G, Qiu F, Sen S (2013) SIPLIB: A stochastic integer programming test problem library. http://www.isye.gatech.edu/∼sahmed/siplib.Google Scholar
• Amaldi E, Kann V (1995) The complexity and approximability of finding maximum feasible subsystems of linear relations. Theoret. Comput. Sci. 147:181–210.Crossref, Google Scholar
• Atamtürk A, Nemhauser GL, Savelsbergh MWP (2000) The mixed vertex packing problem. Math. Programming 89:35–53.Crossref, Google Scholar
• Becker NG, Starczak DN (1997) Optimal vaccination strategies for a community of households. Math. Biosciences 139:117–132.Crossref, Google Scholar
• Chan TM (2005) Low-dimensional linear programming with violations. SIAM J. Comput. 34:879–893.Crossref, Google Scholar
• Conforti M, Wolsey LA (2008) Compact formulations as a union of polyhedra. Math. Programming 114:277–289.Crossref, Google Scholar
• Constantino M, Miller AJ, Van Vyve M (2010) Mixing MIR inequalities with two divisible coefficients. Math. Programming 123:451–483.Crossref, Google Scholar
• Crowder H, Johnson EL, Padberg M (1983) Solving large-scale zero-one linear programming problems. Oper. Res. 31:803–834.Link, Google Scholar
• Dietrich BL, Escudero LF (1990) Coefficient reduction for knapsack-like constraints in 0-1 programs with variable upper bounds. Oper. Res. Lett. 9:9–14.Crossref, Google Scholar
• Garey MR, Johnson DS (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness (W.H. Freeman, New York).Google Scholar
• Guan Y, Ahmed S, Nemhauser GL (2007) Sequential pairing of mixed integer inequalities. Discrete Optim. 4:21–39.Crossref, Google Scholar
• Günlük O, Pochet Y (2001) Mixing mixed integer inequalities. Math. Programming 90:429–457.Crossref, Google Scholar
• Küçükyavuz S (2012) On mixing sets arising in chance-constrained programming. Math. Programming 132:31–56.Crossref, Google Scholar
• Liberti L (2006) Writing global optimization software. Liberti L, Maculan N, eds. Global Optimization (Springer, New York),211–262.Crossref, Google Scholar
• Luedtke J (2010) An integer programming and decomposition approach to general chance-constrained mathematical programs. Eisenbrand F, Shepherd F, eds. Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science, Vol. 6080 (Springer, Berlin, Heidelberg), 271–284.Crossref, Google Scholar
• Luedtke J (2013) A branch-and-cut decomposition algorithm for solving general chance-constrained mathematical programs with finite support. Math. Programming, ePub ahead of print May 22, http://dx.doi.org/10.1007/s10107-013-0684-6.Google Scholar
• Luedtke J, Ahmed S (2008) A sample approximation approach for optimization with probabilistic constraints. SIAM J. Optim. 19:674–699.Crossref, Google Scholar
• Luedtke J, Ahmed S, Nemhauser GL (2010) An integer programming approach for linear programs with probabilistic constraints. Math. Programming 122:247–272.Crossref, Google Scholar
• Miller AJ, Wolsey LA (2003) Tight formulations for some simple mixed integer programs and convex objective integer programs. Math. Programming 98:73–88.Crossref, Google Scholar
• Pagnoncelli B, Ahmed S, Shapiro A (2009) Computational study of a chance constrained portfolio selection problem. J. Optim. Theory Appl. 142:399–416.Crossref, Google Scholar
• Rossi F, Smriglio S, Sassano A (2001) Models and algorithms for terrestrial digital broadcasting. Ann. Oper. Res. 107:267–283.Crossref, Google Scholar
• Savelsbergh MWP (1994) Preprocessing and probing techniques for mixed integer programming problems. ORSA J. Comput. 6:445–454.Link, Google Scholar
• Tanner MW, Ntaimo L (2010) IIS branch-and-cut for joint chance-constrained stochastic programs and application to optimal vaccine allocation. Eur. J. Oper. Res. 207:290–296.Crossref, Google Scholar
• Thomas R, Widmayer P (1994) k-violation linear programming. Inform. Processing Lett. 52:109–114.Crossref, Google Scholar
• Tunçel AT, Preciado F, Rardin RL, Langer M, Richard J-P (2012) Strong valid inequalities for fluence map optimization problem under dose-volume restrictions. Ann. Oper. Res. 196:819–840.Crossref, Google Scholar
• Zhao M, de Farias IR Jr (2008) The mixing-MIR set with divisible capacities. Math. Programming 115:73–103.Crossref, Google Scholar