Abstract
In this paper we discuss valid inequalities for the directed hop-constrained shortest path problem. We give complete linear characterizations of the hop-constrained path polytope when the maximum number of hops is equal to 2 or 3. We also present a lifted version of the “jump” inequalities introduced by Dahl (Oper. Res. Lett. 25 (1999) 97) and show that this class of inequalities subsumes inequalities contained in the complete linear description for the case H=3 as well as a large class of facet defining inequalities for the case H=4. We use a minmax result by Robacker (Research Memorandum RM-1660, The Rand Corporation, Santa Monica, 1956) to present a framework for deriving a large class of cut-like inequalities for the hop-constrained path problem. A simple relation between the hop-constrained path polytope and the knapsack polytopes is also presented.
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.
