Comments on the 'polynomial formulation and heuristic-based approach for the k-travelling repairman problem'

İmdat Kara and Bahar Y. Kara

International Journal of Mathematics in Operational Research, 2019, vol. 15, issue 1, 26-32

Abstract: The paper 'polynomial formulation and heuristic-based approach for the k-travelling repairman problem' claims to present the first polynomial formulation for the k-travelling repairman problem (k-TRP). We first make some corrections on this formulation and we show that the first polynomial size formulation for k-TRP is the one proposed by Kara et al. (2008).

Keywords: repairman problem; k-travelling repairman problem; minimum latency problem; delivery man problem. (search for similar items in EconPapers)
Date: 2019
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=101610 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmore:v:15:y:2019:i:1:p:26-32

Access Statistics for this article

More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().