The selective travelling salesman problem
From MaRDI portal
Publication:910347
DOI10.1016/0166-218X(90)90100-QzbMath0695.90098MaRDI QIDQ910347
Gilbert Laporte, Silvano Martello
Publication date: 1990
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Integer programming (90C10)
Related Items
The median tour and maximal covering tour problems: Formulations and heuristics, Strong linear programming relaxations for the orienteering problem, The multi-vehicle profitable pickup and delivery problem, A matheuristic approach to the orienteering problem with service time dependent profits, Shared capacity routing problem -- an omni-channel retail study, Iterated local search for the team orienteering problem with time windows, The clustered orienteering problem, A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem, A TSSP+1 decomposition strategy for the vehicle routing problem, A guided local search metaheuristic for the team orienteering problem, An iterated local search algorithm for the team orienteering problem with variable profits, Exact algorithms for budgeted prize-collecting covering subgraph problems, UAV routing for reconnaissance mission: a multi-objective orienteering problem with time-dependent prizes and multiple connections, Efficient meta-heuristics for the multi-objective time-dependent orienteering problem, Single string planning problem arising in liner shipping industries: a heuristic approach, The multi-district team orienteering problem, A two-stage approach to the orienteering problem with stochastic weights, Heuristics for the time dependent team orienteering problem: application to tourist route planning, Managing platelet supply through improved routing of blood collection vehicles, A hybrid variable neighborhood search for the orienteering problem with mandatory visits and exclusionary constraints, The bi-objective insular traveling salesman problem with maritime and ground transportation costs, Hybrid dynamic programming with bounding algorithm for the multi-profit orienteering problem, Solving the team orienteering problem with cutting planes, Time constrained maximal covering salesman problem with weighted demands and partial coverage, Using artificial neural networks to solve the orienteering problem, Routing problems: A bibliography, AN INTEGER L-SHAPED ALGORITHM FOR TIME-CONSTRAINED TRAVELING SALESMAN PROBLEM WITH STOCHASTIC TRAVEL AND SERVICE TIMES, Evolution-inspired local improvement algorithm solving orienteering problem, Orienteering problem with time-windows and updating delay, The orienteering problem with variable profits, Multiobjective routing problems, On the nucleolus of the basic vehicle routing game, A hybrid adaptive large neighborhood search heuristic for the team orienteering problem, The team orienteering problem with time windows: an LP-based granular variable neighborhood search, Column generation based heuristics for a generalized location routing problem with profits arising in space exploration, The time-dependent capacitated profitable tour problem with time windows and precedence constraints, PILOT, GRASP, and VNS approaches for the static balancing of bicycle sharing systems, Design of diversified package tours for the digital travel industry: a branch-cut-and-price approach, The orienteering problem: a survey, Multiperiod integrated spare parts and tour planning for on-site maintenance activities with stochastic repair requests, Trip planning for visitors in a service system with capacity constraints, Formulations for the orienteering problem with additional constraints, Clustered coverage orienteering problem of unmanned surface vehicles for water sampling, A revisited branch-and-cut algorithm for large-scale orienteering problems, Solving Relaxation Orienteering Problem Using DCA-CUT, Hybridized evolutionary local search algorithm for the team orienteering problem with time windows, Hybrid genetic algorithm for undirected traveling salesman problems with profits, The hazardous orienteering problem, A new mathematical model and a heuristic algorithm for the tourist trip design problem under new constraints: a real-world application, A stabilized column generation scheme for the traveling salesman subtour problem, A unified matheuristic for solving multi-constrained traveling salesman problems with profits, Analysis of the selective traveling salesman problem with time-dependent profits, On Prize‐collecting Tours and the Asymmetric Travelling Salesman Problem, Multi-objective meta-heuristics for the traveling salesman problem with profits, Robust UAV mission planning, An improvement heuristic based on variable neighborhood search for a dynamic orienteering problem, Online covering salesman problem, Mixed-integer programming approaches for the time-constrained maximal covering routing problem, Finding the nucleolus of the vehicle routing game with time windows, An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits, Solving the team orienteering arc routing problem with a column generation approach, Attractive orienteering problem with proximity and timing interactions, A memetic algorithm for the orienteering problem with mandatory visits and exclusionary constraints, An exact algorithm for team orienteering problems, On symmetric subtour problems, Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem, Local search for the undirected capacitated arc routing problem with profits, Multi-objective vehicle routing problems, An integer programming-based local search for the covering salesman problem, Simultaneous sensor selection and routing of unmanned aerial vehicles for complex mission plans, Genetic algorithm for combinatorial path planning: the subtour problem, A TABU search heuristic for the team orienteering problem, Shuffling heuristics for the storage location assignment in an AS/RS, A path relinking approach for the team orienteering problem, Selected combinatorial problems of computational biology, Models for a Steiner ring network design problem with revenues, A hybrid metaheuristic for the prize-collecting single machine scheduling problem with sequence-dependent setup times, Formulation and a two-phase matheuristic for the roaming salesman problem: application to election logistics, A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem, A two-stage vehicle routing model for large-scale bioterrorism emergencies, A Tabu search algorithm for the probabilistic orienteering problem, A multi-period analysis of the integrated item-sharing and crowdshipping problem, Pre-selection Strategies for Dynamic Collaborative Transportation Planning Problems, Modeling the Mobile Oil Recovery Problem as a Multiobjective Vehicle Routing Problem, The Generalized Covering Salesman Problem, A fast and effective heuristic for the orienteering problem, The vehicle routing-allocation problem: A unifying framework, Minimum directed 1-subtree relaxation for score orienteering problem, The attractive traveling salesman problem, Tabu search for DNA sequencing with false negatives and false positives, A branch-and-cut algorithm for the capacitated profitable tour problem, A Variable Neighborhood Search Algorithm for Cost-Balanced Travelling Salesman Problem, A tabu search heuristic for the undirected selective travelling salesman problem, A fast solution method for the time-dependent orienteering problem
Cites Work
