This site uses cookies to deliver our services and to ensure you get the best experience. By continuing to use this site, you consent to our use of cookies and acknowledge that you have read and understand our Privacy Policy, Cookie Policy, and Terms
This paper presents upper bounds for the Satellite Revenue Selection and Scheduling problem (SRSS). A compact model of this generalized Prize Collecting Traveling Salesman Problem ...