Comments on the 'polynomial formulation and heuristic-based approach for the k-travelling repairman problem'
buir.contributor.author | Kara, Bahar Y. | |
dc.citation.epage | 32 | en_US |
dc.citation.issueNumber | 1 | en_US |
dc.citation.spage | 26 | en_US |
dc.citation.volumeNumber | 15 | en_US |
dc.contributor.author | Kara, İ. | |
dc.contributor.author | Kara, Bahar Y. | |
dc.date.accessioned | 2021-03-27T19:54:54Z | |
dc.date.available | 2021-03-27T19:54:54Z | |
dc.date.issued | 2019 | |
dc.department | Department of Industrial Engineering | en_US |
dc.description.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). | en_US |
dc.description.provenance | Submitted by Evrim Ergin (eergin@bilkent.edu.tr) on 2021-03-27T19:54:53Z No. of bitstreams: 1 Bilkent-research-paper.pdf: 268963 bytes, checksum: ad2e3a30c8172b573b9662390ed2d3cf (MD5) | en |
dc.description.provenance | Made available in DSpace on 2021-03-27T19:54:54Z (GMT). No. of bitstreams: 1 Bilkent-research-paper.pdf: 268963 bytes, checksum: ad2e3a30c8172b573b9662390ed2d3cf (MD5) Previous issue date: 2019 | en |
dc.identifier.doi | 10.1504/IJMOR.2019.101610 | en_US |
dc.identifier.eissn | 1757-5869 | |
dc.identifier.issn | 1757-5850 | |
dc.identifier.uri | http://hdl.handle.net/11693/76007 | |
dc.language.iso | English | en_US |
dc.publisher | Inderscience Enterprises Ltd. | en_US |
dc.relation.isversionof | https://doi.org/10.1504/IJMOR.2019.101610 | en_US |
dc.source.title | International Journal of Mathematics in Operational Research | en_US |
dc.subject | Repairman problem | en_US |
dc.subject | k-travelling repairman problem | en_US |
dc.subject | Minimum latency problem | en_US |
dc.subject | Delivery man problem | en_US |
dc.title | Comments on the 'polynomial formulation and heuristic-based approach for the k-travelling repairman problem' | en_US |
dc.type | Article | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Comments_on_the_polynomial_formulation_and_heuristic-based_approach_for_the_k-travelling_repairman_problem.pdf
- Size:
- 325.33 KB
- Format:
- Adobe Portable Document Format
- Description:
License bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- license.txt
- Size:
- 1.71 KB
- Format:
- Item-specific license agreed upon to submission
- Description: