Modeling Disjunctive Constraints via Junction Trees

Simple item page
dc.contributor.advisorHicks, Illya V.
dc.contributor.advisorHuchette, Joseph A.
dc.creatorLyu, Bochuan
dc.date.accessioned2021-12-22T19:30:01Z
dc.date.available2021-12-22T19:30:01Z
dc.date.created2022-05
dc.date.issued2021-12-22
dc.date.submittedMay 2022
dc.date.updated2021-12-22T19:30:01Z
dc.description.abstractIn this thesis, we study the independent-branching (IB) framework of disjunctive constraints and identify a class of pairwise IB-representable disjunctive constraints: disjunctive constraints with junction trees. For this class of constraints, the existence of junction trees can be recognized in polynomial time. We also present a polynomial-time heuristic algorithm for the minimum biclique cover problem on the associated conflict graphs to build small and strong mixed-integer programming (MIP) formulations. Additionally, we apply the heuristic to find a smaller MIP formulation of generalized special ordered set with less variables and constraints than Huchette and Vielma [2019]. In computational experiments, we compare the proposed heuristic with other methods on a large set of artificially generated disjunctive constraints with junction trees. The new method significantly reduces the numbers of binary variables and constraints required for the MIP formulations than those of vertex cover approach.
dc.format.mimetypeapplication/pdf
dc.identifier.citationLyu, Bochuan. "Modeling Disjunctive Constraints via Junction Trees." (2021) Master’s Thesis, Rice University. <a href="https://hdl.handle.net/1911/111896">https://hdl.handle.net/1911/111896</a>.
dc.identifier.urihttps://hdl.handle.net/1911/111896
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.subjectMixed-integer Programming
dc.subjectDisjunctive Constraints
dc.subjectMinimum Biclique Cover Problem
dc.titleModeling Disjunctive Constraints via Junction Trees
dc.typeThesis
dc.type.materialText
thesis.degree.departmentComputational and Applied Mathematics
thesis.degree.disciplineEngineering
thesis.degree.grantorRice University
thesis.degree.levelMasters
thesis.degree.nameMaster of Arts
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
LYU-DOCUMENT-2022.pdf
Size:
769.02 KB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 2 of 2
No Thumbnail Available
Name:
PROQUEST_LICENSE.txt
Size:
5.84 KB
Format:
Plain Text
Description:
Download
No Thumbnail Available
Name:
LICENSE.txt
Size:
2.6 KB
Format:
Plain Text
Description:
Download
Collections
Rice University Electronic Theses and Dissertations