The maximum collection problem with time-dependent rewards

DOI10.1002/(SICI)1520-6750(199608)43:5%3C749::AID-NAV10%3E3.0.CO;2-JMaRDI QIDQ5687647zbMATH OpenOpenAlexFDO

Authors Erhan Erkut, Jian-Jun Zhang

Publication date 16 December 1996

Full work available at URL https://doi.org/10.1002/(sici)1520-6750(199608)43:5%3C749::aid-nav10%3E3.0.co;2-j

zbMATH Keywords

branch-and-bound optimal algorithmpenalty-based greedy heuristic algorithmroutingsum of the rewards

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Mixed integer programming (90C11) Programming involving graphs or networks (90C35)

Recommendations

• AN ALGORITHM FOR SINGLE CONSTRAINT MAXIMUM COLLECTION PROBLEM
• A heuristic for the multiple tour maximum collection problem
• An optimal solution procedure for the multiple tour maximum collection problem using column generation
• The robot routing problem for collecting aggregate stochastic rewards
• Heuristics for the traveling repairman problem with profits

Cited in

(20)

• An optimal solution procedure for the multiple tour maximum collection problem using column generation
• A heuristic for the multiple tour maximum collection problem
• A matheuristic approach to the orienteering problem with service time dependent profits
• Time dependent orienteering problem with time windows and service time dependent profits
• UAV routing for reconnaissance mission: a multi-objective orienteering problem with time-dependent prizes and multiple connections
• Hybrid evolutionary search for the traveling repairman problem with profits
• An improvement heuristic based on variable neighborhood search for a dynamic orienteering problem
• Agile Earth observation satellite scheduling: an orienteering problem with time-dependent profits and travel times
• An exact algorithm for Agile Earth Observation Satellite scheduling with time-dependent profits
• Analysis of the selective traveling salesman problem with time-dependent profits
• Heuristics for the traveling repairman problem with profits
• Heuristics for the time dependent team orienteering problem: application to tourist route planning
• Models and hybrid methods for the onshore wells maintenance problem
• AN ALGORITHM FOR SINGLE CONSTRAINT MAXIMUM COLLECTION PROBLEM
• A periodic traveling politician problem with time-dependent rewards
• Team Orienteering with Time-Varying Profit
• The robot routing problem for collecting aggregate stochastic rewards
• Arrival and service time dependencies in the single- and multi-visit selective traveling salesman problem
• A unifying framework for selective routing problems
• Branch-price-and-cut algorithms for the team orienteering problem with interval-varying profits

This page was built for publication: The maximum collection problem with time-dependent rewards

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5687647)