Walk on the hypercube with minimum similarities

DOI10.55630/SJC.2022.16.57-70zbMath1517.90045MaRDI QIDQ6488188

Georgi Hristov Georgiev, Borislav Yurukov, Emil Kelevedjiev, Nicola Yanev

Publication date: 30 March 2023

Published in: Serdica Journal of Computing (Search for Journal in Brave)

zbMATH Keywords

integer programmingschedulingtravelling salesman problemtransportation problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• The Traveling Salesman Problem with Many Visits to Few Cities
• Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey
• Unnamed Item
• Unnamed Item

This page was built for publication: Walk on the hypercube with minimum similarities