On the matrix cuts of Lovasz and Schrijver and their use in integer programming

dc.contributor.advisorCook, William J.
dc.creatorDash, Sanjeeb
dc.date.accessioned2009-06-04T08:37:48Z
dc.date.available2009-06-04T08:37:48Z
dc.date.issued2001
dc.description.abstractAn important approach to solving many discrete optimization problems is to associate the discrete set (over which we wish to optimize) with the 0-1 vectors in a given polyhedron and to derive linear inequalities valid for these 0-1 vectors from a linear inequality system defining the polyhedron. Lovasz and Schrijver (1991) described a family of operators, called the matrix-cut operators, which generate strong valid inequalities, called matrix cuts, for the 0-1 vectors in a polyhedron. This family includes the commutative, semidefinite and division operators; each operator can be applied iteratively to obtain, in n iterations for polyhedra in n-space, the convex hull of 0-1 vectors. We study the complexity of matrix-cut based methods for solving 0-1 integer linear programs. We first prove bounds on the (rank) number of iterations required to obtain the integer hull. We show that the upper bound of n, mentioned above, can be attained in the case of the semidefinite operator, answering a question of Goemans. We also determine the semidefinite rank of the standard linear relaxation of the traveling salesman polytope up to a constant factor. We study the use of the semidefinite operator in solving numerical instances and present results on some combinatorial examples and also on a few instances from the MIPLIB test set. Finally, we examine the lengths of cutting-plane proofs based on matrix cuts. We answer a question of Pudlak on such proofs, and prove an exponential lower bound on the length of cutting-plane proofs based on one class of matrix cuts.
dc.format.extent112 p.en_US
dc.format.mimetypeapplication/pdf
dc.identifier.callnoTHESIS MATH.SCI. 2001 DASH
dc.identifier.citationDash, Sanjeeb. "On the matrix cuts of Lovasz and Schrijver and their use in integer programming." (2001) Diss., Rice University. <a href="https://hdl.handle.net/1911/17952">https://hdl.handle.net/1911/17952</a>.
dc.identifier.urihttps://hdl.handle.net/1911/17952
dc.language.isoeng
dc.rightsCopyright is held by the author, unless otherwise indicated. Permission to reuse, publish, or reproduce the work beyond the bounds of fair use or other exemptions to copyright law must be obtained from the copyright holder.
dc.subjectMathematics
dc.subjectOperations research
dc.titleOn the matrix cuts of Lovasz and Schrijver and their use in integer programming
dc.typeThesis
dc.type.materialText
thesis.degree.departmentMathematical Sciences
thesis.degree.disciplineEngineering
thesis.degree.grantorRice University
thesis.degree.levelDoctoral
thesis.degree.nameDoctor of Philosophy
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
3021110.PDF
Size:
4.02 MB
Format:
Adobe Portable Document Format