Abstract
We discuss possible integer linear programming formulations of a class of partitioning problems, which includes vertex (and edge) coloring and bin packing, and present some basic properties of the associated linear programming relaxations, possibly improved by means of valid inequalities. In particular, we show that these relaxations are sometimes easily solved without resorting to an LP solver, and derive the worst-case performance of the associated bound on the optimal solution value. We also show which is the contribution of each inequality to this bound. Our analysis provides a general framework to unify and generalize some results previously presented in the literature, and should be taken into account whenever one considers the possibility of using the formulations addressed.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
