Comments on: ``Polynomial formulation and heuristic-based approach for the \(k\)-travelling repairman problem'' (Q2205068)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Comments on: ``Polynomial formulation and heuristic-based approach for the \(k\)-travelling repairman problem'' |
scientific article |
Statements
Comments on: ``Polynomial formulation and heuristic-based approach for the \(k\)-travelling repairman problem'' (English)
0 references
20 October 2020
0 references
Summary: The paper ``Polynomial formulation and heuristic-based approach for the \(k\)-travelling repairman problem'' [\textit{I. O. Ezzine} and \textit{S. Elloumi}, ibid. 4, No. 5, 503--514 (2012; Zbl 1390.90580)] 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).
0 references
repairman problem
0 references
\(k\)-travelling repairman problem
0 references
minimum latency problem
0 references
delivery man problem
0 references