{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T23:16:09Z","timestamp":1762298169593},"reference-count":22,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T00:00:00Z","timestamp":1441065600000},"content-version":"tdm","delay-in-days":335,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[2014,10]]},"DOI":"10.1002\/net.21569","type":"journal-article","created":{"date-parts":[[2014,10,7]],"date-time":"2014-10-07T12:16:39Z","timestamp":1412684199000},"page":"169-180","source":"Crossref","is-referenced-by-count":7,"title":["The Rural Postman Problem with time windows"],"prefix":"10.1002","volume":"64","author":[{"given":"Marcela","family":"Monroy-Licht","sequence":"first","affiliation":[{"name":"D\u00e9partement de Math\u00e9matiques et de G\u00e9nie Industriel; \u00c9cole Polytechnique de Montr\u00e9al; Quebec Canada"},{"name":"Centre Interuniversitaire de Recherche, sur les R\u00e9seaux d'Entreprises; la Logistique et le Transport (CIRRELT); Montr\u00e9al Quebec Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ciro Alberto","family":"Amaya","sequence":"additional","affiliation":[{"name":"Departamento de Ingenier\u00eda Industrial; Universidad de Los Andes; Bogot\u00e1 Colombia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9","family":"Langevin","sequence":"additional","affiliation":[{"name":"D\u00e9partement de Math\u00e9matiques et de G\u00e9nie Industriel; \u00c9cole Polytechnique de Montr\u00e9al; Quebec Canada"},{"name":"Centre Interuniversitaire de Recherche, sur les R\u00e9seaux d'Entreprises; la Logistique et le Transport (CIRRELT); Montr\u00e9al Quebec Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2014,10,7]]},"reference":[{"key":"10.1002\/net.21569-BIB0001|net21569-cit-0001","volume-title":"Solving the asymmetric traveling salesman problem with time windows by branch-and-cut, Technical Report Takustra\u00dfe D-14195","author":"Ascheuer","year":"1999"},{"key":"10.1002\/net.21569-BIB0002|net21569-cit-0002","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1007\/PL00011432","article-title":"Solving the asymmetric traveling salesman problem with time windows by branch-and-cut","volume":"90","author":"Ascheuer","year":"2001","journal-title":"Math Program"},{"key":"10.1002\/net.21569-BIB0003|net21569-cit-0003","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1023\/A:1008779125567","article-title":"A branch and cut algorithm for the asymmetric traveling salesman problem with precedence constraints","volume":"17","author":"Ascheuer","year":"2000","journal-title":"Comput Optim Appl"},{"key":"10.1002\/net.21569-BIB0004|net21569-cit-0004","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/BF01585767","article-title":"The precedence constrained asymmetric traveling salesman polytope","volume":"68","author":"Balas","year":"1995","journal-title":"Math Program"},{"key":"10.1002\/net.21569-BIB0005|net21569-cit-0005","volume-title":"An algorithm for the Rural Postman Problem, Report JC.O.R.81.5","author":"Christofides","year":"1981"},{"key":"10.1002\/net.21569-BIB0006|net21569-cit-0006","volume-title":"A polyhedral approach to the rural postman problem, Working Paper, Departamento de Estadistica e Investigaci\u00f4n operative","author":"Corber\u00e1n","year":"1991"},{"key":"10.1002\/net.21569-BIB0007|net21569-cit-0007","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0377-2217(94)90398-0","article-title":"A polyhedral approach to the rural postman problem","volume":"79","author":"Corber\u00e1n","year":"1994","journal-title":"Eur J Oper Res"},{"key":"10.1002\/net.21569-BIB0008|net21569-cit-0008","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0167-6377(91)90083-2","article-title":"Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints","volume":"10","author":"Desrochers","year":"1991","journal-title":"Oper Res Lett"},{"key":"10.1002\/net.21569-BIB0009|net21569-cit-0009","first-page":"443","volume-title":"\u201cLivestock feed distribution and arc traversal problems,\u201d Arc routing. Theory, solutions and applications","author":"Dror","year":"2000"},{"key":"10.1002\/net.21569-BIB0010|net21569-cit-0010","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1287\/opre.43.3.399","article-title":"Arc routing problems, part II: The rural postman problem","volume":"43","author":"Eiselt","year":"1995","journal-title":"Oper Res"},{"key":"10.1002\/net.21569-BIB0011|net21569-cit-0011","doi-asserted-by":"crossref","first-page":"1520","DOI":"10.1287\/mnsc.43.11.1520","article-title":"A polyhedral approach to the asymmetric traveling salesman problem","volume":"43","author":"Fischetti","year":"1997","journal-title":"Manage Sci"},{"key":"10.1002\/net.21569-BIB0012|net21569-cit-0012","volume-title":"M\u00e9thodes de r\u00e9solution exacte pour les probl\u00e8mes de tourn\u00e9es de v\u00e9hicules, Doctoral Dissertation, Laboratoire Productique Logistique","author":"Gueguen","year":"1999"},{"key":"10.1002\/net.21569-BIB0013|net21569-cit-0013","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/S0927-0507(05)80121-5","volume-title":"Network Models","volume":"7","author":"J\u00fcnger","year":"1995"},{"key":"10.1002\/net.21569-BIB0014|net21569-cit-0014","first-page":"259","volume-title":"\u201cComparison of crossover operators for Rural Postman Problem with Time Windows,\u201d Soft Computing in Engineering Design and Manufacture","author":"Kang","year":"1998"},{"key":"10.1002\/net.21569-BIB0015|net21569-cit-0015","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1016\/S0377-2217(97)00090-8","article-title":"The Rural Postman Problem with deadline classes","volume":"105","author":"Letchford","year":"1998","journal-title":"Eur J Oper Res"},{"key":"10.1002\/net.21569-BIB0016|net21569-cit-0016","volume-title":"Capacitated rural postman problem with timewindows and split delivery, PhD Thesis, MIS Department","volume":"85721,","author":"Mullaseril","year":"1996"},{"key":"10.1002\/net.21569-BIB0017|net21569-cit-0017","volume-title":"A set-covering approach for directed node and arc routing problems with split delivery and time windows, Working Paper, MIS Department","author":"Mullaseril","year":"1996"},{"key":"10.1002\/net.21569-BIB0018|net21569-cit-0018","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1057\/palgrave.jors.2600338","article-title":"Split-delivery routeing heuristics in livestock feed distribution","volume":"48","author":"Mullaseril","year":"1997","journal-title":"J Oper Res Soc"},{"key":"10.1002\/net.21569-BIB0019|net21569-cit-0019","volume-title":"A heuristic algorithm for the Rural Postman Problem with Time Windows, Meetings2 INFORMS","author":"Nobert","year":"1994"},{"key":"10.1002\/net.21569-BIB0020|net21569-cit-0020","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BF01580850","article-title":"An efficient algorithm for the minimum capacity cut problem","volume":"47","author":"Padberg","year":"1990","journal-title":"Math Program"},{"key":"10.1002\/net.21569-BIB0021|net21569-cit-0021","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1137\/1033004","article-title":"A branch and cut algorithm for the resolution of large-scale Symmetric Traveling Salesman Problems","volume":"33","author":"Padberg","year":"1991","journal-title":"SIAM Rev"},{"key":"10.1002\/net.21569-BIB0022|net21569-cit-0022","volume-title":"Contributions to arc routing, Doctoral Dissertation, Faculty of Social Sciences","author":"W\u00f8hlk","year":"2005"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.21569","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full\/10.1002\/net.21569","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,5]],"date-time":"2021-07-05T04:53:20Z","timestamp":1625460800000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.21569"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,10]]}},"URL":"https:\/\/doi.org\/10.1002\/net.21569","relation":{},"ISSN":["0028-3045"],"issn-type":[{"value":"0028-3045","type":"print"}],"subject":[],"published":{"date-parts":[[2014,10]]}}}