Analysis of Sparse Cutting-plane for Sparse IPs with Applications to Stochastic IPs

Abstract

In this paper, we present an analysis of the strength of sparse cutting-planes for mixed integer linear programs (MILP) with sparse formulations. We examine three kinds of problems: packing problems, covering problems, and more general MILPs with the only assumption that the objective function is non-negative. Given a MILP instance of one of these three… (More)

Topics

7 Figures and Tables

Cite this paper

@inproceedings{Dey2015AnalysisOS, title={Analysis of Sparse Cutting-plane for Sparse IPs with Applications to Stochastic IPs}, author={Santanu S. Dey and Marco Molinaro and Qianyi Wang}, year={2015} }