Solving the probabilistic profitable tour problem on a line

DOI10.1007/s11590-022-01960-zarXiv2204.07378OpenAlexW4313479883MaRDI QIDQ6081600

Renata Mansini, Enrico Angelelli, Romeo Rizzi

Publication date: 26 October 2023

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2204.07378

zbMATH Keywords

traveling salesman problem with profitspolynomial time complexityprobabilistic profitable tour problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Orienteering problem: a survey of recent variants, solution approaches and applications
• The probabilistic orienteering problem
• A branch-and-cut algorithm for the capacitated profitable tour problem
• Complexity and approximation for traveling salesman problems with profits
• Algorithms - ESA 2003

This page was built for publication: Solving the probabilistic profitable tour problem on a line