J. Monnot, “The Maximum Hamiltonian Path Problem with Specified Endpoint(s),” European Journal of Operational Research, Vol. 161, 2005, pp. 721-735. doi:10.1016/j.ejor.2003.09.007
has been cited by the following article:
TITLE: The Maximum Hamilton Path Problem with Parameterized Triangle Inequality
AUTHORS: Weidong Li, Jianping Li, Zefeng Qiao, Honglin Ding
KEYWORDS: Maximum Traveling Salesman Problem; Parameterized Triangle Inequality; Approximation Algorithm
JOURNAL NAME: Communications and Network, Vol.5 No.1B, November 7, 2013
ABSTRACT: Given a complete graph with edge-weights satisfying parameterized triangle inequality, we consider the maximum Hamilton path problem and design some approximation algorithms.