Abstract
We are given \(n\) airplanes, which can refuel one another during the flight. Each airplane has a specific tank volume and gas consumption rate. The goal of the airplane refueling problem is to find a drop out permutation for the planes that maximizes the distance traveled by the last plane to drop out. This paper studies some structural properties of the problem and proposes pruning rules for an exact resolution.
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.
