关于“k行修理工问题的多项式公式和启发式方法”的评注

Int. J. Math. Oper. Res. Pub Date : 2019-08-02 DOI:10.1504/IJMOR.2019.10022828

Imdat Kara, B. Kara

{"title":"关于“k行修理工问题的多项式公式和启发式方法”的评注","authors":"Imdat Kara, B. Kara","doi":"10.1504/IJMOR.2019.10022828","DOIUrl":null,"url":null,"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).","PeriodicalId":306451,"journal":{"name":"Int. J. Math. Oper. Res.","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Comments on the 'polynomial formulation and heuristic-based approach for the k-travelling repairman problem'\",\"authors\":\"Imdat Kara, B. Kara\",\"doi\":\"10.1504/IJMOR.2019.10022828\",\"DOIUrl\":null,\"url\":null,\"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).\",\"PeriodicalId\":306451,\"journal\":{\"name\":\"Int. J. Math. Oper. Res.\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-08-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Int. J. Math. Oper. Res.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1504/IJMOR.2019.10022828\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Math. Oper. Res.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/IJMOR.2019.10022828","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

本文“k行修理工问题的多项式公式和启发式方法”提出了k行修理工问题(k-TRP)的第一个多项式公式。我们首先对这个公式进行了一些修正，并表明k-TRP的第一个多项式大小公式是Kara等人(2008)提出的。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

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

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).

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Int. J. Math. Oper. Res.

自引率

0.00%

发文量