Comments on the 'polynomial formulation and heuristic-based approach for the k-travelling repairman problem'
International Journal of Mathematics in Operational Research
Inderscience Enterprises Ltd.
26 - 32
Item Usage Stats
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).
k-travelling repairman problem
Minimum latency problem
Delivery man problem
Published Version (Please cite this version)https://doi.org/10.1504/IJMOR.2019.101610
Showing items related by title, author, creator and subject.
Pilanci, Mert; Arıkan, Orhan; Oguz, B.; Pınar, Mustafa C. (IEEE, 2009)In many signal processing applications the core problem reduces to a linear system of equations. Coefficient matrix uncertainties create a significant challenge in obtaining reliable solutions. In this paper, we present a ...
Urfalıoğlu, Onay; Arıkan, Orhan (IEEE, 2009-12)Many real world problems which can be assigned to the machine learning domain are inverse problems. The available data is often noisy and may contain outliers, which requires the application of global optimization. ...
Accuracy and efficiency considerations in the solution of extremely large electromagnetics problems Gürel, Levent; Ergül, Özgür (IEEE, 2011)This study considers fast and accurate solutions of extremely large electromagnetics problems. Surface formulations of large-scale objects lead to dense matrix equations involving millions of unknowns. Thanks to recent ...