Abstract
Abstract Given a graph G = ( V , E ) on n vertices, the Minimum Linear Arrangement Problem (MinLA) calls for a one-to-one function ψ : V → { 1 , … , n } which minimizes ∑ { i , j } ∈ E | ψ ( i ) − ψ ( j ) | . MinLA is strongly NP -hard and very difficult to solve to optimality in practice. One of the reasons for this difficulty is the lack of good lower bounds. In this paper, we take a polyhedral approach to MinLA. We associate an integer polyhedron with each graph G, and derive many classes of valid linear inequalities. It is shown that a cutting plane algorithm based on these inequalities can yield competitive lower bounds in a reasonable amount of time. A key to the success of our approach is that our linear programs contain only | E | variables. We conclude showing computational results on benchmark graphs from literature.
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 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.
