The capacitated team orienteering and profitable tour problems
From MaRDI portal
Recommendations
- The capacitated team orienteering problem with incomplete service
- The capacitated team orienteering problem: a bi-level filter-and-fan method
- The capacitated orienteering problem
- The team orienteering problem: formulations and branch-cut and price
- The split delivery capacitated team orienteering problem
- Robust Team Orienteering Problem with Decreasing Profits
- The multi-visit team orienteering problem with precedence constraints
- An exact algorithm for team orienteering problems
- On a model and optimization algorithms for a dynamic team orienteering problem
Cited in
(53)- A matheuristic approach to the orienteering problem with service time dependent profits
- Solving the multi-vehicle multi-covering tour problem
- A profit-maximization location-routing-pricing problem: a branch-and-price algorithm
- The vehicle routing problem with service level constraints
- A branch-and-price approach to the feeder network design problem
- A unified matheuristic for solving multi-constrained traveling salesman problems with profits
- The undirected capacitated general routing problem with profits
- Attractive orienteering problem with proximity and timing interactions
- The vehicle routing problem with profits and consistency constraints
- Consistent vehicle routing with pickup decisions -- insights from sport academy training transfers
- Neural large neighborhood search for routing problems
- The synchronized multi-assignment orienteering problem
- Optimal joint maintenance and orienteering strategy for complex mission-oriented systems: a case study in offshore wind energy
- Design of diversified package tours for the digital travel industry: a branch-cut-and-price approach
- A generic exact solver for vehicle routing and related problems
- The capacitated team orienteering problem: a bi-level filter-and-fan method
- Proportion-based robust optimization and team orienteering problem with interval data
- Formulation and a two-phase matheuristic for the roaming salesman problem: application to election logistics
- The multi-visit team orienteering problem with precedence constraints
- Capacitated ring arborescence problems with profits
- Shared resources in collaborative vehicle routing
- A branch-and-cut algorithm for the capacitated profitable tour problem
- The multi-vehicle profitable pickup and delivery problem
- A hybrid metaheuristic for smart waste collection problems with workload concerns
- A new accessibility based team orienteering approach for urban tourism routes optimization (a real life case)
- Trip planning for visitors in a service system with capacity constraints
- The split delivery capacitated team orienteering problem
- The team orienteering pick-up and delivery problem with time windows and its applications in fleet sizing
- Integrated charge batching and casting width selection at Baosteel
- An adaptive large neighborhood search algorithm for a selective and periodic inventory routing problem
- A matheuristic for the team orienteering arc routing problem
- Orienteering problem: a survey of recent variants, solution approaches and applications
- The dynamic multiperiod vehicle routing problem with probabilistic information
- A branch-price-and-cut algorithm for the workover rig routing problem
- The capacitated team orienteering problem with incomplete service
- A selective adaptive large neighborhood search heuristic for the profitable tour problem with simultaneous pickup and delivery services
- A worst-case analysis for the split delivery capacitated team orienteering problem with minimum delivery amounts
- The capacitated orienteering problem
- Team Orienteering with Time-Varying Profit
- The orienteering problem with variable profits
- Solving the team orienteering problem with nonidentical agents: A Lagrangian approach
- GRASP‐ILS and set cover hybrid heuristic for the synchronized team orienteering problem with time windows
- Planning robust drone-truck delivery routes under road traffic uncertainty
- The orienteering problem: a survey
- Multi-start heuristics for unit-capacity orienteering problems
- A matheuristic for the split delivery capacitated profitable tour problem with incomplete service
- Modeling a humanitarian-aid covering tour problem with location selection and vehicle assignment decisions
- Integrating shift planning and pick-up and delivery problems under limited Courier availability
- Capacitated profitable tour problem with cross-docking
- A unifying framework for selective routing problems
- A large neighbourhood search heuristic for ship routing and scheduling with split loads
- Solving heterogeneous vehicle routing problems using decomposition and set covering
- The undirected capacitated arc routing problem with profits
This page was built for publication: The capacitated team orienteering and profitable tour problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3184456)
