A unifying framework for selective routing problems
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 4051316 (Why is no real title available?)
- scientific article; zbMATH DE number 2064404 (Why is no real title available?)
- scientific article; zbMATH DE number 2064416 (Why is no real title available?)
- scientific article; zbMATH DE number 2064417 (Why is no real title available?)
- scientific article; zbMATH DE number 795217 (Why is no real title available?)
- scientific article; zbMATH DE number 3895002 (Why is no real title available?)
- scientific article; zbMATH DE number 3278972 (Why is no real title available?)
- scientific article; zbMATH DE number 3298367 (Why is no real title available?)
- scientific article; zbMATH DE number 3335671 (Why is no real title available?)
- A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem
- A TSSP+1 decomposition strategy for the vehicle routing problem
- A beam search for the equality generalized symmetric traveling salesman problem
- A bi-objective metaheuristic for disaster relief operation planning
- A branch-and-price algorithm for the vehicle routing problem with deliveries, selective pickups and time windows
- A classification scheme for vehicle routing and scheduling problems
- A comparative study of heuristics for a two-level routing-location problem
- A concise guide to the Traveling Salesman Problem
- A covering traveling salesman problem with profit in the last mile delivery
- A heuristic for the multiple tour maximum collection problem
- A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem
- A large neighbourhood search metaheuristic for the contagious disease testing problem
- A multi‐vehicle covering tour problem with speed optimization
- A note on the prize collecting traveling salesman problem
- A survey of recent research on location-routing problems
- A survey of variants and extensions of the location-routing problem
- A two-phase algorithm for the partial accessibility constrained vehicle routing problem
- AN ALGORITHM FOR SINGLE CONSTRAINT MAXIMUM COLLECTION PROBLEM
- An Insert/Delete Heuristic for the Travelling Salesman Subset-Tour Problem with One Additional Constraint
- An efficient transformation of the generalized vehicle routing problem
- An iterated local search algorithm for the team orienteering problem with variable profits
- Approximation algorithms for the Geometric Covering Salesman Problem
- Approximation algorithms for time-dependent orienteering.
- Column generation based heuristics for a generalized location routing problem with profits arising in space exploration
- Combined location-routing problems: A synthesis and future research directions
- Exact and heuristic algorithms for solving the generalized vehicle routing problem with flexible fleet size
- Generalized Travelling Salesman Problem Through n Sets Of Nodes: An Integer Programming Approach
- Generalized orienteering problem with resource dependent rewards
- Handbooks in operations Research \& management science: Transportation
- Heuristic and exact algorithms for a min-max selective vehicle routing problem
- Heuristics for the multi-vehicle covering tour problem
- Locating a cycle in a transportation or a telecommunications network
- Locating median cycles in networks
- Location-routing: issues, models and methods
- Multicriteria tour planning for mobile healthcare facilities in a developing country
- New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen
- On Prize‐collecting Tours and the Asymmetric Travelling Salesman Problem
- On the generalized 2-peripatetic salesman problem
- Orienteering problem: a survey of recent variants, solution approaches and applications
- Profit-based latency problems on the line
- Randomized heuristics for the family traveling salesperson problem
- Rich vehicle routing problems: from a taxonomy to a definition
- Selective vehicle routing for a mobile blood donation system
- Solution of a Large-Scale Traveling-Salesman Problem
- Solving a school bus scheduling problem with integer programming
- Solving a vehicle-routing problem arising in soft-drink distribution
- The Capacitated m-Ring-Star Problem
- The Covering Salesman Problem
- The Covering Tour Problem
- The Plant Location Problem: New Models and Research Prospects
- The Ring Star Problem: Polyhedral analysis and exact algorithm
- The attractive traveling salesman problem
- The capacitated team orienteering and profitable tour problems
- The close enough traveling salesman problem: a discussion of several heuristics
- The clustered orienteering problem
- The clustered team orienteering problem
- The generalized close enough traveling salesman problem
- The generalized covering salesman problem
- The hazardous orienteering problem
- The maximum collection problem with time-dependent rewards
- The median tour and maximal covering tour problems: Formulations and heuristics
- The multi-vehicle probabilistic covering tour problem
- The orienteering problem
- The orienteering problem with variable profits
- The orienteering problem: a survey
- The prize collecting traveling salesman problem
- The selective travelling salesman problem
- The set orienteering problem
- The share-a-ride problem: people and parcels sharing taxis
- The single vehicle routing problem with deliveries and selective pickups
- The single‐vehicle routing problem with unrestricted backhauls
- The team orienteering problem
- The traveling salesman problem. A computational study.
- The truck dispatching problem
- The vehicle routing problem. Latest advances and new challenges.
- The vehicle routing-allocation problem: A unifying framework
- Tourist trip design with heterogeneous preferences, transport mode selection and environmental considerations
- Travelling purchaser problem
- Vehicle Routing
Cited in
(2)
This page was built for publication: A unifying framework for selective routing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6982539)
