ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2002.01070
  4. Cited By
The Node Weight Dependent Traveling Salesperson Problem: Approximation
  Algorithms and Randomized Search Heuristics

The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics

4 February 2020
Jakob Bossek
Katrin Casel
P. Kerschke
Frank Neumann
ArXiv (abs)PDFHTML

Papers citing "The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics"

4 / 4 papers shown
Title
Route Design in Sheepdog System--Traveling Salesman Problem Formulation
  and Evolutionary Computation Solution--
Route Design in Sheepdog System--Traveling Salesman Problem Formulation and Evolutionary Computation Solution--
Wataru Imahayashi
Y. Tsunoda
Masaki Ogura
24
0
0
03 Oct 2023
On the Impact of Operators and Populations within Evolutionary
  Algorithms for the Dynamic Weighted Traveling Salesperson Problem
On the Impact of Operators and Populations within Evolutionary Algorithms for the Dynamic Weighted Traveling Salesperson Problem
Jakob Bossek
Aneta Neumann
Frank Neumann
49
0
0
30 May 2023
Post-Disaster Repair Crew Assignment Optimization Using Minimum Latency
Post-Disaster Repair Crew Assignment Optimization Using Minimum Latency
Anakin Dey
Melkior Ornik
16
1
0
01 Jun 2022
Optimising Tours for the Weighted Traveling Salesperson Problem and the
  Traveling Thief Problem: A Structural Comparison of Solutions
Optimising Tours for the Weighted Traveling Salesperson Problem and the Traveling Thief Problem: A Structural Comparison of Solutions
Jakob Bossek
Aneta Neumann
Frank Neumann
29
2
0
05 Jun 2020
1