Tour recommendation for groups

DOI10.1007/s10618-016-0477-7zbMath1411.90287OpenAlexW2521036580WikidataQ116754388 ScholiaQ116754388MaRDI QIDQ1741326

Adriano Fazzone, Reem Atassi, Aris Anagnostopoulos, Fabrizio Silvestri, Luca Becchetti

Publication date: 3 May 2019

Published in: Data Mining and Knowledge Discovery (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10618-016-0477-7

zbMATH Keywords

orienteering problemgroup recommendationtour recommendation for groups

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Semantic trajectory representation and retrieval via hierarchical embedding

Uses Software

• IPS
• GroupBox

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• New approaches to multi-objective optimization
• Shorter tours by nicer ears: \(7/5\)-approximation for the graph-TSP, \(3/2\) for the path version, and \(4/3\) for two-edge-connected subgraphs
• Analysis of Christofides' heuristic: some paths are more difficult than cycles
• Approximate Pareto sets of minimal size for multi-objective optimization problems
• Worst-case analysis of a new heuristic for the travelling salesman problem
• A greedy approximation algorithm for the group Steiner problem
• Approximating the Pareto Front of Multi-criteria Optimization Problems
• Using a Genetic Algorithm to Solve the Generalized Orienteering Problem
• Approximation algorithms for deadline-TSP and vehicle routing with time-windows
• Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
• Approximation Algorithms for Orienteering and Discounted-Reward TSP
• Computer Solutions of the Traveling Salesman Problem

This page was built for publication: Tour recommendation for groups