Abstract
The primal separation problem for {0,1/2}-cuts is: Given a vertex xˆ of the integer hull of a polytope P and some fractional point x⁎∈P, does there exist a {0,1/2}-cut that is tight at xˆ and violated by x⁎? We present two cases for which primal separation is solvable in polynomial time. Furthermore, we show that the optimization problem over the {0,1/2}-closure can be solved in polynomial time up to a factor (1+ε), for any fixed ε>0.
Sign-in/Register to access full text options 
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 callSimilar Papers
Disclaimer: 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.
