On solving Travelling Salesman Problem with Vertex Requisitions

DOI10.2298/YJOR161012003EzbMath1474.90529arXiv1703.03963MaRDI QIDQ4987704

Anton Valentinovich Eremeev, Julia Viktorovna Kovalenko

Publication date: 3 May 2021

Published in: Yugoslav Journal of Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

integer programmingcombinatorial optimizationlocal searchsystem of vertex requisitions

Mathematics Subject Classification ID

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

Hybridizations of evolutionary algorithms with large neighborhood search

Cites Work

• Optimal recombination in genetic algorithms for combinatorial optimization problems: Part II
• Computational bounds for local search in combinatorial optimization
• `` Strong NP-Completeness Results
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On solving Travelling Salesman Problem with Vertex Requisitions