Showing 81 - 90 of 636,715
Given a weighted graph G = (V, E), the Equitable Traveling Salesman Problem (ETSP) asks for two perfect matchings in G such that (1) the two matchings together form a Hamiltonian cycle in G and (2) the absolute difference in costs between the two matchings is minimized. The problem is shown to...
Persistent link: https://www.econbiz.de/10012993673
Persistent link: https://www.econbiz.de/10012622239
Persistent link: https://www.econbiz.de/10013259380
consideration has been attained for the exact algorithms. This paper develops an exact Lexi-search algorithm (LSA) that effectively …. A numerical example is also illustrated in the provision of the theory …
Persistent link: https://www.econbiz.de/10013211939
Persistent link: https://www.econbiz.de/10012649023
Persistent link: https://www.econbiz.de/10010210740
Persistent link: https://www.econbiz.de/10009776287
Persistent link: https://www.econbiz.de/10010219622
Persistent link: https://www.econbiz.de/10011673547
Persistent link: https://www.econbiz.de/10011807914