Pulse nav.journalClub Debates ativos Tendências Explorar Pesquisadores

Download the App

Join discussions, follow papers, and never miss your next session.

Download on theApp Store

© Synapse Social LLC, 2026

Política de privacidade

Início Explorar nav.journalClub Tendências

⌘+K

May 1, 2024Open Access

On approximating a new generalization of traveling salesman problem

Key Points

Key points are not available for this paper at this time.

Abstract

The current best-known performance guarantees for the extensively studied Traveling Salesman Problem (TSP) of determinate approximation algorithms is

Read Full Paperexternally

Perguntar à IA

Like

Bookmark

Share

View Full Paper

Perguntar à IA

Like

Bookmark

Share

View Full Paper

Cite This Study

Huang et al. (Wed,) studied this question.

synapsesocial.com/papers/68e6c339b6db6435876427d1 https://doi.org/https://doi.org/10.1016/j.heliyon.2024.e31297

On approximating a new generalization of traveling salesman problem | Synapse

Also Consider

Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context:

1A branch-and-cut algorithm for the generalized traveling salesman problem with time windows2020 · 42 citations
2Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem2022 · 1,143 citations