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

Simple item page
buir.contributor.authorKara, Bahar Y.
dc.citation.epage32en_US
dc.citation.issueNumber1en_US
dc.citation.spage26en_US
dc.citation.volumeNumber15en_US
dc.contributor.authorKara, İ.
dc.contributor.authorKara, Bahar Y.
dc.date.accessioned2021-03-27T19:54:54Z
dc.date.available2021-03-27T19:54:54Z
dc.date.issued2019
dc.departmentDepartment of Industrial Engineeringen_US
dc.description.abstractThe 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.identifier.doi10.1504/IJMOR.2019.101610en_US
dc.identifier.eissn1757-5869
dc.identifier.issn1757-5850
dc.identifier.urihttp://hdl.handle.net/11693/76007
dc.language.isoEnglishen_US
dc.publisherInderscience Enterprises Ltd.en_US
dc.relation.isversionofhttps://doi.org/10.1504/IJMOR.2019.101610en_US
dc.source.titleInternational Journal of Mathematics in Operational Researchen_US
dc.subjectRepairman problemen_US
dc.subjectk-travelling repairman problemen_US
dc.subjectMinimum latency problemen_US
dc.subjectDelivery man problemen_US
dc.titleComments on the 'polynomial formulation and heuristic-based approach for the k-travelling repairman problem'en_US
dc.typeArticleen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
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:
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
Department of Industrial Engineering