{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T18:52:10Z","timestamp":1775069530914,"version":"3.50.1"},"reference-count":699,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1983,1,1]],"date-time":"1983-01-01T00:00:00Z","timestamp":410227200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[1983,1]]},"DOI":"10.1016\/0305-0548(83)90030-8","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T16:15:45Z","timestamp":1056989745000},"page":"63-211","source":"Crossref","is-referenced-by-count":676,"title":["Routing and scheduling of vehicles and crews"],"prefix":"10.1016","volume":"10","author":[{"given":"Samuel","family":"Raff","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(83)90030-8_BIB1","series-title":"Logistics","first-page":"1","article-title":"An algorithm for transportation routing and vehicle loading","author":"Agin","year":"1975"},{"key":"10.1016\/0305-0548(83)90030-8_BIB2","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0305-0548(83)90030-8_BIB3","article-title":"An analysis of various aspects of the traveling salesman problem","author":"Akl","year":"1978"},{"issue":"4","key":"10.1016\/0305-0548(83)90030-8_BIB4","first-page":"132","article-title":"The minimal directed spanning graph for combinatorial optimization","volume":"12","author":"Akl","year":"1980","journal-title":"Austral. Comput. J."},{"issue":"4","key":"10.1016\/0305-0548(83)90030-8_BIB5","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0771-050X(81)90057-7","article-title":"On the expected number of optimal and near-optimal solutions to the Euclidean traveling salesman problem","volume":"7","author":"Akl","year":"1981","journal-title":"J. Comput. Appl. Math."},{"key":"10.1016\/0305-0548(83)90030-8_BIB6","article-title":"The M-travelling salesman problem: a duality based branch and bound algorithm","author":"Ali","year":"1981"},{"key":"10.1016\/0305-0548(83)90030-8_BIB7","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1109\/TSMC.1971.4308296","article-title":"A nonlinear programming model for household refuse collection","volume":"SMC-1","author":"Altman","year":"1971","journal-title":"IEEE Trans. Systems, Man. Cybernetics"},{"issue":"6","key":"10.1016\/0305-0548(83)90030-8_BIB8","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1287\/mnsc.18.6.B279","article-title":"Computer Assisted School Bus Scheduling","volume":"18","author":"Angel","year":"1972","journal-title":"Management Sci."},{"key":"10.1016\/0305-0548(83)90030-8_BIB9","article-title":"Optimization of vehicle schedules for a road transit corporation","author":"Ankolekar","year":"1981","journal-title":"University of Montreal Transportation Research Center Publication No. 213"},{"key":"10.1016\/0305-0548(83)90030-8_BIB10","series-title":"Vehicle Scheduling Program","year":"1968"},{"issue":"2","key":"10.1016\/0305-0548(83)90030-8_BIB11","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1287\/trsc.3.2.140","article-title":"The airline crew scheduling problem: a survey","volume":"3","author":"Arabeyre","year":"1969","journal-title":"Transportation Sci."},{"key":"10.1016\/0305-0548(83)90030-8_BIB12","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1287\/trsc.11.2.124","article-title":"The \u201chub\u201d and \u201cwheel\u201d scheduling problems","volume":"2","author":"Arisawa","year":"1977","journal-title":"Transportation Sci."},{"issue":"3","key":"10.1016\/0305-0548(83)90030-8_BIB13","first-page":"332","article-title":"Decomposition and sensitivity analysis in an aircraft tasking problem","volume":"15","author":"Armstrong","year":"1977","journal-title":"INFOR"},{"issue":"3","key":"10.1016\/0305-0548(83)90030-8_BIB14","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1002\/nav.3800250311","article-title":"Optimal dispatching strategies for vehicles having exponentially distributed trip times","volume":"25","author":"Asghrazadeh","year":"1978","journal-title":"Naval Res. Logistics Quart."},{"issue":"1","key":"10.1016\/0305-0548(83)90030-8_BIB15","first-page":"59","article-title":"Analytic models in rail transportation: an annotated bibliography","volume":"19","author":"Assad","year":"1981","journal-title":"INFOR"},{"key":"10.1016\/0305-0548(83)90030-8_BIB16","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0191-2607(80)90017-5","article-title":"Models for rail transportation","volume":"14A","author":"Assad","year":"1980","journal-title":"Transportation Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB17","article-title":"Modeling rail freight management","author":"Assad","year":"1978"},{"key":"10.1016\/0305-0548(83)90030-8_BIB18","series-title":"Proc. 1981 Northeast AIDS Conf.","first-page":"99","article-title":"Combined distribution routing and scheduling in a large commercial firm","author":"Assad","year":"1981"},{"key":"10.1016\/0305-0548(83)90030-8_BIB19","series-title":"Proc. of 1982 Southeast TIMS Conference","first-page":"315","article-title":"Design of an inventory\/routing system for a large propane-distribution firm","author":"Assad","year":"1982"},{"key":"10.1016\/0305-0548(83)90030-8_BIB20","doi-asserted-by":"crossref","DOI":"10.1080\/05695557908974446","article-title":"Efficient heuristic solutions for the airline crew scheduling problem","author":"Baker","year":"1979"},{"key":"10.1016\/0305-0548(83)90030-8_BIB21","series-title":"Time oriented vehicle routing and the traveling salesman problem","author":"Baker","year":"1980"},{"key":"10.1016\/0305-0548(83)90030-8_BIB22","article-title":"An algorithm for vehicle routing with time window constraints","author":"Baker","year":"1981"},{"issue":"2","key":"10.1016\/0305-0548(83)90030-8_BIB23","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1080\/05695557908974446","article-title":"Efficient heuristic solutions to an airline crew scheduling problem","volume":"11","author":"Baker","year":"1979","journal-title":"AIIE Trans."},{"key":"10.1016\/0305-0548(83)90030-8_BIB24","article-title":"The development and implementation of a heuristic set covering based system for air crew scheduling","author":"Baker","year":"1980"},{"key":"10.1016\/0305-0548(83)90030-8_BIB25","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1016\/0305-0483(81)90049-9","article-title":"Computational results for very large air crew scheduling problems","volume":"9","author":"Baker","year":"1981","journal-title":"Omega"},{"key":"10.1016\/0305-0548(83)90030-8_BIB26","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1080\/05695557308974891","article-title":"An optimal procedure for allocating manpower with cyclic requirements","volume":"5","author":"Baker","year":"1973","journal-title":"AIIE Trans."},{"key":"10.1016\/0305-0548(83)90030-8_BIB27","doi-asserted-by":"crossref","first-page":"1561","DOI":"10.1287\/mnsc.20.12.1561","article-title":"Scheduling a full-time workforce to meet cyclic staffing requirements","volume":"20","author":"Baker","year":"1974","journal-title":"Management Sci."},{"key":"10.1016\/0305-0548(83)90030-8_BIB28","series-title":"Ninth Math. Prog. Symp.","article-title":"A new penalty method for the travelling salesman problem","author":"Balas","year":"1976"},{"key":"10.1016\/0305-0548(83)90030-8_BIB29","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BF01584228","article-title":"A restricted Lagrangean approach to the travelling salesman problem","volume":"21","author":"Balas","year":"1981","journal-title":"Math. Prog."},{"key":"10.1016\/0305-0548(83)90030-8_BIB30","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/BFb0120886","article-title":"Set Covering Algorithms Using Cutting Planes, Heuristics and Subgradient Optimization: A Computational Study","volume":"12","author":"Balas","year":"1980","journal-title":"Mathematical Programming Study"},{"issue":"4","key":"10.1016\/0305-0548(83)90030-8_BIB31","doi-asserted-by":"crossref","first-page":"710","DOI":"10.1137\/1018115","article-title":"Set partitioning: a survey","volume":"18","author":"Balas","year":"1976","journal-title":"SIAM Rev."},{"key":"10.1016\/0305-0548(83)90030-8_BIB32","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1287\/opre.12.2.300","article-title":"On an integer program for a delivery problem","volume":"12","author":"Balinski","year":"1964","journal-title":"Op. Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB33","series-title":"Presented at National ORSA\/TIMS Meeting","article-title":"A comparison of relaxations and heuristics for certain crew and vehicle scheduling problems","author":"Ball","year":"1980"},{"key":"10.1016\/0305-0548(83)90030-8_BIB34","article-title":"Garage Location for an Urban Mass Transit System","author":"Ball","year":"1981"},{"issue":"1","key":"10.1016\/0305-0548(83)90030-8_BIB35","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/trsc.17.1.4","article-title":"A matching based heuristic for scheduling mass transit crews and vehicles","volume":"17","author":"Ball","year":"1983","journal-title":"Transportation Science"},{"key":"10.1016\/0305-0548(83)90030-8_BIB36","series-title":"Computer Scheduling of Public Transport Urban Passenger Vehicle and Crew Scheduling","first-page":"313","article-title":"Experimentation with a computerized system for scheduling mass transit vehicles and crews","author":"Ball","year":"1981"},{"key":"10.1016\/0305-0548(83)90030-8_BIB37","series-title":"World Conf. on Transport Res.","article-title":"Scheduling of drivers for mass transit systems using interactive optimization","author":"Ball","year":"1980"},{"issue":"1","key":"10.1016\/0305-0548(83)90030-8_BIB38","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1111\/j.1540-5915.1983.tb00172.x","article-title":"Planning for truck fleet size in the presence of a common carrier option","volume":"14","author":"Ball","year":"1983","journal-title":"Decision Sciences"},{"key":"10.1016\/0305-0548(83)90030-8_BIB39","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1002\/net.3230110210","article-title":"The design and analysis of heuristics","volume":"11","author":"Ball","year":"1981","journal-title":"Networks"},{"key":"10.1016\/0305-0548(83)90030-8_BIB40","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1287\/opre.5.6.841","article-title":"Graphical solution of the traveling-salesman problem","volume":"5","author":"Barachet","year":"1957","journal-title":"Ops Res."},{"issue":"1","key":"10.1016\/0305-0548(83)90030-8_BIB41","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1007\/BF01585504","article-title":"An improved version of the out-of-kilter method and a comparative study of computer codes","volume":"7","author":"Barr","year":"1974","journal-title":"Math. Prog."},{"key":"10.1016\/0305-0548(83)90030-8_BIB42","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01584319","article-title":"The alternating basis algorithm for assignment problems","volume":"13","author":"Barr","year":"1977","journal-title":"Math. Prog."},{"key":"10.1016\/0305-0548(83)90030-8_BIB43","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0377-2217(78)90110-8","article-title":"The generalized alternating path algorithm for transportation problems","volume":"2","author":"Barr","year":"1978","journal-title":"Eur. J. Ops Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB44","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1287\/opre.29.3.501","article-title":"A guaranteed accuracy round-off algorithm for cyclic scheduling and set covering","volume":"29","author":"Bartholdi","year":"1981","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB45","doi-asserted-by":"crossref","first-page":"1074","DOI":"10.1287\/opre.28.5.1074","article-title":"Cyclic scheduling via integer programs with circular ones","volume":"28","author":"Bartholdi","year":"1980","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB46","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1002\/nav.3800040205","article-title":"An algorithm for the minimum number of transport units to maintain a fixed schedule","volume":"4","author":"Bartlett","year":"1957","journal-title":"Naval Res. Logistics Quart."},{"key":"10.1016\/0305-0548(83)90030-8_BIB47","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1002\/nav.3800040308","article-title":"Cyclic scheduling and combinatorial topology: assignment of routing and motive power to meet scheduling and maintenance requirements: Part II. Generalizations and analysis","volume":"4","author":"Bartlett","year":"1957","journal-title":"Naval Res. Logistics Quart."},{"key":"10.1016\/0305-0548(83)90030-8_BIB48","series-title":"Transportation\u2014A Service","first-page":"549","article-title":"The optimum routing for an air cargo carrier's mixed fleet","author":"Barton","year":"1968"},{"key":"10.1016\/0305-0548(83)90030-8_BIB49","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/BF01584338","article-title":"The traveling salesman: a duality approach","volume":"13","author":"Bazaraa","year":"1977","journal-title":"Math. Prog."},{"key":"10.1016\/0305-0548(83)90030-8_BIB50","first-page":"299","article-title":"The shortest path through many points","volume":"55","author":"Beardwood","year":"1959"},{"key":"10.1016\/0305-0548(83)90030-8_BIB51","doi-asserted-by":"crossref","first-page":"658","DOI":"10.1016\/0305-0483(81)90055-4","article-title":"Adapting the savings algorithm for varying inter-customer travel times","volume":"9","author":"Beasley","year":"1981","journal-title":"Omega"},{"key":"10.1016\/0305-0548(83)90030-8_BIB52","series-title":"Studies in the Economics of Transportation","author":"Beckman","year":"1955"},{"key":"10.1016\/0305-0548(83)90030-8_BIB53","series-title":"Dynamic Programming","author":"Bellman","year":"1957"},{"key":"10.1016\/0305-0548(83)90030-8_BIB54","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1090\/qam\/102435","article-title":"On a routing problem","volume":"16","author":"Bellman","year":"1958","journal-title":"Quart. Appl. Math."},{"key":"10.1016\/0305-0548(83)90030-8_BIB55","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1145\/321105.321111","article-title":"Dynamic programming treatment of the traveling salesman problem","volume":"9","author":"Bellman","year":"1962","journal-title":"J. ACM"},{"key":"10.1016\/0305-0548(83)90030-8_BIB56","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0022-247X(69)90209-1","article-title":"The K\u00f6nigsberg Bridges problem generalized","volume":"25","author":"Bellman","year":"1969","journal-title":"J. Math. Anal. Appl."},{"key":"10.1016\/0305-0548(83)90030-8_BIB57","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1145\/321105.321111","article-title":"Dynamic programming treatment of the travelling salesman problem","volume":"9","author":"Bellmore","year":"1962","journal-title":"J. ACM"},{"issue":"1","key":"10.1016\/0305-0548(83)90030-8_BIB58","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1287\/trsc.5.1.36","article-title":"A multivehicle tanker scheduling problem","volume":"5","author":"Bellmore","year":"1971","journal-title":"Transportation Sci."},{"key":"10.1016\/0305-0548(83)90030-8_BIB59","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1145\/321832.321847","article-title":"Transformation of multi-salesman problem to the standard traveling salesman problem","volume":"21","author":"Bellmore","year":"1974","journal-title":"J. ACM"},{"key":"10.1016\/0305-0548(83)90030-8_BIB60","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1287\/opre.19.2.278","article-title":"Pathology of traveling-salesman subtour-elimination algorithms","volume":"19","author":"Bellmore","year":"1971","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB61","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1287\/opre.16.3.538","article-title":"The traveling salesman problem: a survey","volume":"16","author":"Bellmore","year":"1974","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB62","series-title":"Models for Public Systems Analysis","author":"Beltrami","year":"1977"},{"key":"10.1016\/0305-0548(83)90030-8_BIB63","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1002\/net.3230040106","article-title":"Networks and vehicle routing for municipal waste collection","volume":"4","author":"Beltrami","year":"1974","journal-title":"Networks"},{"key":"10.1016\/0305-0548(83)90030-8_BIB64","doi-asserted-by":"crossref","DOI":"10.1007\/BF01386316","article-title":"Partitioning procedures for solving mixed variable programming problems","volume":"4","author":"Benders","year":"1962","journal-title":"Num. Math."},{"key":"10.1016\/0305-0548(83)90030-8_BIB65","article-title":"Optimization of bus crew rosters: an application of combinatorial mathematics","author":"Bennett","year":"1967"},{"issue":"4","key":"10.1016\/0305-0548(83)90030-8_BIB66","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0041-1647(72)90072-X","article-title":"School bus routing by computer","volume":"6","author":"Bennett","year":"1972","journal-title":"Transportation Res."},{"issue":"1","key":"10.1016\/0305-0548(83)90030-8_BIB67","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1287\/trsc.2.1.14","article-title":"Rotating roster for a transit system","volume":"2","author":"Bennett","year":"1968","journal-title":"Transportation Sci."},{"issue":"4","key":"10.1016\/0305-0548(83)90030-8_BIB68","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1002\/nav.3800170406","article-title":"Resource allocation for transportation","volume":"17","author":"Bennington","year":"1970","journal-title":"Naval Res. Logistics Quart."},{"key":"10.1016\/0305-0548(83)90030-8_BIB69","series-title":"Preprints: Workshop on Automated Techniques for Scheduling of Vehicle Operators for Urban Public Transportation Services","article-title":"Overview of RUCUS vehicle scheduling program (BLOCKS)","author":"Bennington","year":"1975"},{"key":"10.1016\/0305-0548(83)90030-8_BIB70","series-title":"Proc. of the 18th Annual Allerton Conference on Communication, Control, and Computing","first-page":"41","article-title":"An analysis of two heuristics for the Euclidean traveling salesman problem","author":"Bentley","year":"1980"},{"issue":"3","key":"10.1016\/0305-0548(83)90030-8_BIB71","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1016\/0377-2217(79)90143-7","article-title":"A characterization of linear admissible transformations for theM-traveling salesman problem","volume":"3","author":"Berenguer","year":"1979","journal-title":"European J. Op. Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB72","series-title":"Programming, Games and Transportation Networks","author":"Berge","year":"1965"},{"key":"10.1016\/0305-0548(83)90030-8_BIB73","series-title":"Preprints: Workshop on Automated Techniques for Scheduling of Vehicle Operators for Urban Public Transportation Services","article-title":"Minimal Cost allocations of bus driving assignments between split runs and trippers","author":"Bergmann","year":"1975"},{"key":"10.1016\/0305-0548(83)90030-8_BIB74","series-title":"Preprints: Workshop on Automated Techniques for Scheduling of Vehicle Operators for Urban Public Transportation Services","year":"1975"},{"key":"10.1016\/0305-0548(83)90030-8_BIB75","series-title":"Presented at the 1975 Chicago ORSA meeting","article-title":"A heuristic approach to vehicle scheduling with due-date constraints","author":"Biles","year":"1975"},{"key":"10.1016\/0305-0548(83)90030-8_BIB76","article-title":"HASTUS: an evaluation model for drivers union negotiation in transit companies","author":"Blais","year":"1980"},{"key":"10.1016\/0305-0548(83)90030-8_BIB77","article-title":"HASTUS for Bus operator scheduling: the man-machine interface","author":"Blais","year":"1981","journal-title":"University of Montreal Transportation Research Center Publication No. 231"},{"key":"10.1016\/0305-0548(83)90030-8_BIB78","series-title":"Specifications for a subscriber dial-a-ride system","author":"Bodin","year":"1980"},{"key":"10.1016\/0305-0548(83)90030-8_BIB79","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0305-7097(75)90003-4","article-title":"A taxonomic structure for vehicle routing and scheduling problems","volume":"1","author":"Bodin","year":"1975","journal-title":"Comput. Urban Soc."},{"key":"10.1016\/0305-0548(83)90030-8_BIB80","first-page":"28","article-title":"A transit operating cost model based on direct systems characteristics","author":"Bodin","year":"1977","journal-title":"Transportation Res. Record No. 654"},{"key":"10.1016\/0305-0548(83)90030-8_BIB81","first-page":"210","article-title":"Towards a general model for manpower scheduling\u2014Parts 1 and 2","author":"Bodin","year":"1973","journal-title":"J. Urban Anal."},{"issue":"2","key":"10.1016\/0305-0548(83)90030-8_BIB82","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1287\/trsc.13.2.113","article-title":"Routing and scheduling of school buses by computer","volume":"13","author":"Bodin","year":"1979","journal-title":"Transportation Sci."},{"key":"10.1016\/0305-0548(83)90030-8_BIB83","first-page":"58","article-title":"Hierarchical procedures for determining vehicle and crew requirements for mass transit systems","volume":"746","author":"Bodin","year":"1980","journal-title":"Transportation Res. Record"},{"key":"10.1016\/0305-0548(83)90030-8_BIB84","series-title":"Proc. ACM Urban Symp.","article-title":"Scheduling of committees for the New York State Assembly","author":"Bodin","year":"1971"},{"issue":"2","key":"10.1016\/0305-0548(83)90030-8_BIB85","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1002\/net.3230110204","article-title":"Classification in vehicle routing and scheduling","volume":"11","author":"Bodin","year":"1981","journal-title":"Networks"},{"key":"10.1016\/0305-0548(83)90030-8_BIB86","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0191-2615(80)90037-5","article-title":"A model for the blocking of trains","volume":"14B","author":"Bodin","year":"1980","journal-title":"Transportation Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB87","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0305-0548(79)90002-9","article-title":"A detailed description of a street sweeper routing and scheduling system","volume":"6","author":"Bodin","year":"1979","journal-title":"Comput, Ops Res."},{"issue":"4","key":"10.1016\/0305-0548(83)90030-8_BIB88","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1287\/opre.26.4.525","article-title":"A computer-assisted system for the routing and scheduling of street sweepers","volume":"26","author":"Bodin","year":"1978","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB89","series-title":"Preprints: Workshop on Automated Techniques for Scheduling of Vehicle Operators for Urban Public Transportation Services","article-title":"Approximation Techniques for automated Manpower Scheduling","author":"Bodin","year":"1975"},{"key":"10.1016\/0305-0548(83)90030-8_BIB90","article-title":"Estimation of the operating cost of mass transit systems","author":"Bodin","year":"1976"},{"key":"10.1016\/0305-0548(83)90030-8_BIB91","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0305-0548(81)90029-0","article-title":"Scheduling and estimation techniques for transportation planning","volume":"8","author":"Bodin","year":"1981","journal-title":"Comput. Ops Res."},{"issue":"1","key":"10.1016\/0305-0548(83)90030-8_BIB92","first-page":"47","article-title":"UCOST. A micro approach to a transit planning problem","volume":"5","author":"Bodin","year":"1978","journal-title":"J. Urban Anal."},{"key":"10.1016\/0305-0548(83)90030-8_BIB93","series-title":"ORSA\/TIMS Meeting","article-title":"The subscriber dial-a-ride problem: the Baltimore Maryland Benchmark","author":"Bodin","year":"1980"},{"key":"10.1016\/0305-0548(83)90030-8_BIB94","article-title":"The subscriber dial-a-ride problem","author":"Bodin","year":"1979","journal-title":"College of Business and Management, University of Maryland, College Park, Maryland, Report No. UMCP-UMTA-1-79"},{"key":"10.1016\/0305-0548(83)90030-8_BIB95","article-title":"The multi-vehicle subscriber dial-a-ride problem","author":"Bodin","year":"1982"},{"key":"10.1016\/0305-0548(83)90030-8_BIB96","series-title":"Proc. Paper 7451","first-page":"893","article-title":"Optimal routing of refuse collection vehicles","volume":"96","author":"Bodner","year":"1970"},{"key":"10.1016\/0305-0548(83)90030-8_BIB97","series-title":"Proc. of the Tenth AGIFORS Symp. American Airlines","article-title":"A crew planning and scheduling system","author":"Bornemann","year":"1970"},{"key":"10.1016\/0305-0548(83)90030-8_BIB98","series-title":"Computer scheduling of Public Transport: Urban Passenger Vehicle and Crew Scheduling","first-page":"237","article-title":"Crew scheduling by computer: a test on the possibility of designing duties for a certain busline","author":"Borret","year":"1981"},{"issue":"3","key":"10.1016\/0305-0548(83)90030-8_BIB99","first-page":"393","article-title":"Itineraries generator for a linear network","volume":"15","author":"Bourque","year":"1977","journal-title":"INFOR"},{"issue":"1","key":"10.1016\/0305-0548(83)90030-8_BIB100","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.24.1.1","article-title":"Design and implementation of large scale primal transshipment algorithms","volume":"24","author":"Bradley","year":"1977","journal-title":"Management Sci."},{"key":"10.1016\/0305-0548(83)90030-8_BIB101","series-title":"Computer Scheduling of Public Transportation: Urban Passenger Vehicle and Crew Scheduling","first-page":"71","article-title":"Bus scheduling program development for A.T.A.F. Florence","author":"Brandani","year":"1981"},{"key":"10.1016\/0305-0548(83)90030-8_BIB102","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1287\/mnsc.27.1.19","article-title":"Real time dispatch of petroleum tank trucks","volume":"27","author":"Brown","year":"1981","journal-title":"Management Sci."},{"key":"10.1016\/0305-0548(83)90030-8_BIB103","series-title":"Wheel trans: feasibility of computer-aided reservations, scheduling and dispatching","author":"Bunt","year":"1980"},{"issue":"4","key":"10.1016\/0305-0548(83)90030-8_BIB104","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1287\/trsc.10.4.348","article-title":"The traveling salesman location problem","volume":"10","author":"Burness","year":"1976","journal-title":"Transportation Sci."},{"key":"10.1016\/0305-0548(83)90030-8_BIB105","article-title":"Integer programming models of transportation systems: an airline system example","author":"Burger","year":"1966"},{"key":"10.1016\/0305-0548(83)90030-8_BIB106","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/S0167-5060(08)70827-6","article-title":"Traveling salesman and assignment problems: a survey","volume":"4","author":"Burkard","year":"1979","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0305-0548(83)90030-8_BIB107","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-51576-7","article-title":"Assignment and matching problems: solution methods with FORTRAN programs","author":"Burkard","year":"1980"},{"key":"10.1016\/0305-0548(83)90030-8_BIB108","series-title":"Finite Graphs and Networks: an Introduction with Applications","author":"Busacker","year":"1965"},{"key":"10.1016\/0305-0548(83)90030-8_BIB109","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1057\/jors.1979.138","article-title":"The vehicle scheduling problem and Monte Carlo simulation","volume":"30","author":"Buxey","year":"1979","journal-title":"J. Op. Res. Soc."},{"key":"10.1016\/0305-0548(83)90030-8_BIB110","series-title":"The Cost of Trucking: Econometric Analysis","first-page":"47","article-title":"The optimal use of truck fleets","author":"Cabot","year":"1965"},{"issue":"7","key":"10.1016\/0305-0548(83)90030-8_BIB111","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1287\/mnsc.26.7.736","article-title":"Some new branching and bounding criteria for the asymmetric travelling salesman problem","volume":"26","author":"Carpaneto","year":"1980","journal-title":"Management Sci."},{"key":"10.1016\/0305-0548(83)90030-8_BIB112","article-title":"A multilevel bottleneck assignment approach to the bus drivers' rostering problem","author":"Carraresi","year":"1980","journal-title":"University of Montreal Transportation Research Center Publication No. 180"},{"key":"10.1016\/0305-0548(83)90030-8_BIB113","article-title":"Decomposition approaches to large scale bus driver scheduling problems","author":"Carraresi","year":"1980","journal-title":"University of Montreal Transportation Research Center Publication No. 172"},{"issue":"2","key":"10.1016\/0305-0548(83)90030-8_BIB114","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1057\/jors.1972.26","article-title":"TRAMP\u2014a multi-depot vehicle scheduling system","volume":"23","author":"Cassidy","year":"1972","journal-title":"Op. Res. Quart."},{"key":"10.1016\/0305-0548(83)90030-8_BIB115","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1287\/trsc.15.4.338","article-title":"Deficit function bus scheduling with deadheading trip insertions for fleet size reduction","volume":"15","author":"Ceder","year":"1981","journal-title":"Transportation Sci."},{"key":"10.1016\/0305-0548(83)90030-8_BIB116","unstructured":"Center for Urban Analysis, Santa Clara County, Personal Communication (1976)."},{"issue":"2","key":"10.1016\/0305-0548(83)90030-8_BIB117","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1002\/net.3230030204","article-title":"The capacitated minimum spanning tree","volume":"3","author":"Chandy","year":"1973","journal-title":"Networks"},{"key":"10.1016\/0305-0548(83)90030-8_BIB118","article-title":"TRANSCOL: un syst\u00e9me de transport int\u00e9gr\u00e9","author":"Chapleau","year":"1980","journal-title":"University of Montreal Transportation Research Center Publication No. 156"},{"key":"10.1016\/0305-0548(83)90030-8_BIB119","article-title":"A parallel insert method for the capacitated arc routing problem","author":"Chapleau","year":"1982","journal-title":"University of Montreal Transportation Research Center Publication No. 234"},{"key":"10.1016\/0305-0548(83)90030-8_BIB120","article-title":"Clustering for routing in dense area","author":"Chapleau","year":"1981","journal-title":"University of Montreal Transportation Research Center Publication No. 206"},{"key":"10.1016\/0305-0548(83)90030-8_BIB121","first-page":"108","article-title":"An example of an integrated man-machine system for truck scheduling","volume":"19","author":"Chard","year":"1968","journal-title":"Op. Res. Quart."},{"issue":"1","key":"10.1016\/0305-0548(83)90030-8_BIB122","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/355873.355874","article-title":"Computational comparison of eight methods for the maximum network flow problem","volume":"6","author":"Cheung","year":"1980","journal-title":"ACM Trans. Math. Software"},{"issue":"2","key":"10.1016\/0305-0548(83)90030-8_BIB123","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0305-0548(75)90015-5","article-title":"The clustered traveling salesman problem","volume":"2","author":"Chisman","year":"1975","journal-title":"Comput. Ops Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB124","article-title":"The single vehicle many to many routing and scheduling problem with customer-dependent objective function coefficients","author":"Choi","year":"1981"},{"key":"10.1016\/0305-0548(83)90030-8_BIB125","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/BF01580109","article-title":"Edmonds' polytopes and weakly Hamiltonian graphs","volume":"5","author":"Chvatal","year":"1973","journal-title":"Math. Prog."},{"key":"10.1016\/0305-0548(83)90030-8_BIB126","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1137\/0119070","article-title":"The shortest Hamiltonian chain of a graph","volume":"19","author":"Christofides","year":"1970","journal-title":"SIAM J. Applied Math."},{"key":"10.1016\/0305-0548(83)90030-8_BIB127","doi-asserted-by":"crossref","first-page":"1044","DOI":"10.1287\/opre.20.5.1044","article-title":"Bounds for the traveling salesman problem","volume":"20","author":"Christofides","year":"1972","journal-title":"Ops Res."},{"issue":"6","key":"10.1016\/0305-0548(83)90030-8_BIB128","doi-asserted-by":"crossref","first-page":"719","DOI":"10.1016\/0305-0483(73)90089-3","article-title":"The optimum traversal of a graph","volume":"1","author":"Christofides","year":"1973","journal-title":"OMEGA"},{"key":"10.1016\/0305-0548(83)90030-8_BIB129","series-title":"Presented at NATO Conf. on Combinatorial Optimization","article-title":"The vehicle routing problem","author":"Christofides","year":"1974"},{"key":"10.1016\/0305-0548(83)90030-8_BIB130","series-title":"Graph Theory: An Algorithmic Approach","author":"Christofides","year":"1975"},{"key":"10.1016\/0305-0548(83)90030-8_BIB131","first-page":"55","article-title":"The vehicle routing problem","volume":"10","author":"Christofides","year":"1976","journal-title":"Rev. Frans. Res. Op."},{"key":"10.1016\/0305-0548(83)90030-8_BIB132","article-title":"Worst-case analysis of a new heuristic for the traveling salesman problem","author":"Christofides","year":"1976"},{"key":"10.1016\/0305-0548(83)90030-8_BIB133","series-title":"Presented at the Miami ORSA\/TIMS Meeting","article-title":"Trees, cacti, and the traveling salesman problem","author":"Christofides","year":"1976"},{"key":"10.1016\/0305-0548(83)90030-8_BIB134","series-title":"Combinatorial Optimization","article-title":"The traveling salesman problem","author":"Christofides","year":"1979"},{"issue":"2","key":"10.1016\/0305-0548(83)90030-8_BIB135","first-page":"39","article-title":"Uses of a vehicle routing and scheduling system in strategic distribution planning","volume":"7","author":"Christofides","year":"1981","journal-title":"Scand. J. Mat. Admin."},{"key":"10.1016\/0305-0548(83)90030-8_BIB136","series-title":"The period routing problem","author":"Christofides","year":"1979"},{"key":"10.1016\/0305-0548(83)90030-8_BIB137","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1057\/jors.1969.101","article-title":"Expected distances in distribution problems","volume":"20","author":"Christofides","year":"1969","journal-title":"Op. Res. Quart."},{"key":"10.1016\/0305-0548(83)90030-8_BIB138","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1057\/jors.1969.75","article-title":"An algorithm for the vehicle dispatching problem","volume":"20","author":"Christofides","year":"1969","journal-title":"Op. Res. Quart."},{"key":"10.1016\/0305-0548(83)90030-8_BIB139","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1057\/jors.1972.79","article-title":"Algorithms for large-scale traveling salesman problems","volume":"23","author":"Christofides","year":"1972","journal-title":"Op. Res. Quart."},{"key":"10.1016\/0305-0548(83)90030-8_BIB140","series-title":"Presented at Fall ORSA\/TIMS Meeting","article-title":"A shortest path algorithm for generalized weighted matchings in graphs","author":"Christofides","year":"1981"},{"key":"10.1016\/0305-0548(83)90030-8_BIB141","series-title":"Combinatorial Optimization","article-title":"The vehicle routing problem","author":"Christofides","year":"1979"},{"key":"10.1016\/0305-0548(83)90030-8_BIB142","series-title":"Euro-IV Cong.","article-title":"Exact algorithms for the TSP with additional constraints","author":"Christofides","year":"1980"},{"key":"10.1016\/0305-0548(83)90030-8_BIB143","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/BF01589353","article-title":"Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations","volume":"20","author":"Christofides","year":"1981","journal-title":"Math. Prog."},{"issue":"2","key":"10.1016\/0305-0548(83)90030-8_BIB144","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1002\/net.3230110207","article-title":"State space relaxation procedures for the computation of bounds to routing problems","volume":"11","author":"Christofides","year":"1981","journal-title":"Networks"},{"key":"10.1016\/0305-0548(83)90030-8_BIB145","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1287\/opre.12.4.568","article-title":"Scheduling of vehicles from a central depot to a number of delivery points","volume":"12","author":"Clarke","year":"1964","journal-title":"Ops. Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB146","series-title":"Proc. Fourth Int. Conf. Ops Res.","first-page":"81","article-title":"A heuristic approach to some sales territory problems","author":"Cloonan","year":"1966"},{"key":"10.1016\/0305-0548(83)90030-8_BIB147","series-title":"Optimization of a carrier routing problem","author":"Cochran","year":"1967"},{"key":"10.1016\/0305-0548(83)90030-8_BIB148","series-title":"Theory of Scheduling","author":"Conway","year":"1967"},{"key":"10.1016\/0305-0548(83)90030-8_BIB149","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1111\/j.1540-5915.1978.tb00753.x","article-title":"A simulation and statistical analysis of stochastic vehicle routing with timing constraints","volume":"9","author":"Cook","year":"1978","journal-title":"Decision Sci."},{"key":"10.1016\/0305-0548(83)90030-8_BIB150","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1287\/mnsc.23.8.789","article-title":"Location of bank accounts to optimize float: an analytic study of exact and approximate algorithms","volume":"23","author":"Cornuejols","year":"1977","journal-title":"Management Sci."},{"key":"10.1016\/0305-0548(83)90030-8_BIB151","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1007\/BF01588956","article-title":"Tight bounds on Christofides' traveling salesman heuristic","volume":"14","author":"Cornuejols","year":"1978","journal-title":"Math. Prog."},{"key":"10.1016\/0305-0548(83)90030-8_BIB152","article-title":"The travelling salesman polytope and {0,2}-matchings","author":"Cornuejols","year":"1981"},{"key":"10.1016\/0305-0548(83)90030-8_BIB153","article-title":"Le probleme des horaires d'equipage d'une compagnie d'aviation","author":"Crainic","year":"1978","journal-title":"University of Montreal Transportation Research Center Publication No. 122"},{"key":"10.1016\/0305-0548(83)90030-8_BIB154","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1287\/opre.6.6.791","article-title":"A method for solving traveling salesman problems","volume":"6","author":"Croes","year":"1958","journal-title":"Ops Res."},{"issue":"5","key":"10.1016\/0305-0548(83)90030-8_BIB155","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1287\/mnsc.26.5.495","article-title":"Solving large-scale symmetric travelling salesman problems to optimality","volume":"26","author":"Crowder","year":"1980","journal-title":"Management Sci."},{"issue":"2","key":"10.1016\/0305-0548(83)90030-8_BIB156","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1002\/net.3230110206","article-title":"Set partitioning based heuristics for interactive routing","volume":"11","author":"Cullen","year":"1981","journal-title":"Networks"},{"key":"10.1016\/0305-0548(83)90030-8_BIB157","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1007\/BFb0121194","article-title":"A primal algorithm for optimum matching","author":"Cunningham","year":"1978","journal-title":"Math. Prog. Study No. 8: Polyhedral Combinatorics"},{"issue":"1","key":"10.1016\/0305-0548(83)90030-8_BIB158","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1287\/opre.26.1.183","article-title":"Scheduling boats to sample oil wells in Lake Maracaibo","volume":"26","author":"Cunto","year":"1978","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB159","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1002\/net.3230100302","article-title":"Efficient special case algorithms for the N-line planar travelling salesman problem","volume":"10","author":"Cutler","year":"1980","journal-title":"Networks"},{"key":"10.1016\/0305-0548(83)90030-8_BIB160","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/0041-1647(78)90007-2","article-title":"An approximate analytic model of many-to-many demand responsive transportation systems","volume":"12","author":"Daganzo","year":"1978","journal-title":"Trans-portation Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB161","series-title":"Linear Programming and Extensions","author":"Dantzig","year":"1963"},{"issue":"2","key":"10.1016\/0305-0548(83)90030-8_BIB162","doi-asserted-by":"crossref","DOI":"10.1287\/mnsc.6.2.187","article-title":"On the shortest route through a network","volume":"6","author":"Dantzig","year":"1960","journal-title":"Management Sci."},{"key":"10.1016\/0305-0548(83)90030-8_BIB163","series-title":"Theory of Graphs","first-page":"77","article-title":"Finding a cycle in a graph with minimum cost to time ratio with applications to a ship routing problem","author":"Dantzig","year":"1967"},{"key":"10.1016\/0305-0548(83)90030-8_BIB164","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1002\/nav.3800010309","article-title":"Minimizing the number of tankers to meet a fixed schedule","volume":"1","author":"Dantzig","year":"1954","journal-title":"Naval Res. Logistics Quart."},{"issue":"4","key":"10.1016\/0305-0548(83)90030-8_BIB165","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1287\/opre.2.4.393","article-title":"Solution of a large-scale traveling salesman problem","volume":"2","author":"Dantzig","year":"1954","journal-title":"Ops Res."},{"issue":"1","key":"10.1016\/0305-0548(83)90030-8_BIB166","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1287\/opre.7.1.58","article-title":"On a linear programming, combinatorial approach to the traveling salesman problem","volume":"7","author":"Dantzig","year":"1959","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB167","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1287\/mnsc.6.1.80","article-title":"The truck dispatching problem","volume":"6","author":"Dantzig","year":"1959","journal-title":"Management Sci."},{"key":"10.1016\/0305-0548(83)90030-8_BIB168","series-title":"An Introduction to Database Systems","author":"Date","year":"1981"},{"issue":"1","key":"10.1016\/0305-0548(83)90030-8_BIB169","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01581633","article-title":"A note on heuristics for the traveling salesman problem","volume":"19","author":"d'Atri","year":"1980","journal-title":"Math. Prog."},{"key":"10.1016\/0305-0548(83)90030-8_BIB170","article-title":"On the delivery problem and some related topics","author":"Davis","year":"1968"},{"key":"10.1016\/0305-0548(83)90030-8_BIB171","series-title":"Computer Scheduling of Public Transportation: Urban Passenger Vehicle and Crew Scheduling","first-page":"23","article-title":"Service optimisation and route costing and associated computer programs","author":"Davies","year":"1981"},{"key":"10.1016\/0305-0548(83)90030-8_BIB172","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1002\/nav.3800160306","article-title":"A branch-bound algorithm for the capacitated facilities location problem","volume":"16","author":"Davis","year":"1969","journal-title":"Naval Res. Logistics Quart."},{"issue":"1","key":"10.1016\/0305-0548(83)90030-8_BIB173","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1287\/opre.27.1.161","article-title":"Shortest-route methods: 1. Reaching, pruning and buckets","volume":"27","author":"Denardo","year":"1979","journal-title":"Ops. Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB174","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1002\/net.3230110407","article-title":"A shortest augmenting path method for solving minimal perfect matching problems","volume":"11","author":"Derigs","year":"1981","journal-title":"Networks"},{"key":"10.1016\/0305-0548(83)90030-8_BIB175","article-title":"Another composite heuristic for solving Euclidean traveling salesman problems","author":"Derigs","year":"1981"},{"key":"10.1016\/0305-0548(83)90030-8_BIB176","article-title":"Matching code theory Part I. Combinatorial structures and the cardinality matching problem","author":"Derigs","year":"1981"},{"key":"10.1016\/0305-0548(83)90030-8_BIB177","article-title":"On two methods for solving minimal perfect matching problems","author":"Derigs","year":"1979"},{"key":"10.1016\/0305-0548(83)90030-8_BIB178","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/BF02252026","article-title":"An augmenting path method for solving linear bottleneck assignment problems","volume":"19","author":"Derigs","year":"1978","journal-title":"Computing"},{"key":"10.1016\/0305-0548(83)90030-8_BIB179","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1002\/nav.3800130202","article-title":"Surveillance of multicomponent systems: a stochastic traveling salesman's problem","volume":"13","author":"Derman","year":"1966","journal-title":"Naval Res. Logistics Quart."},{"key":"10.1016\/0305-0548(83)90030-8_BIB180","article-title":"A school busing system","author":"Desrosiers","year":"1980"},{"key":"10.1016\/0305-0548(83)90030-8_BIB181","article-title":"Computational Study of the Symmetric assignment problem","author":"Devine","year":"1972"},{"key":"10.1016\/0305-0548(83)90030-8_BIB182","first-page":"165","article-title":"On some combinatorial problems arising in scheduling","volume":"8","author":"DeWerra","year":"1970","journal-title":"J. CORS"},{"issue":"1","key":"10.1016\/0305-0548(83)90030-8_BIB183","first-page":"12","article-title":"Construction of school timetables by flow methods","volume":"9","author":"DeWerra","year":"1971","journal-title":"INFOR"},{"key":"10.1016\/0305-0548(83)90030-8_BIB184","series-title":"Computer Scheduling of Public Transportation: Urban Passenger Vehicle and Crew Scheduling","first-page":"147","article-title":"Scheduling an urban railway","author":"Dexter","year":"1981"},{"key":"10.1016\/0305-0548(83)90030-8_BIB185","doi-asserted-by":"crossref","first-page":"632","DOI":"10.1145\/363269.363610","article-title":"Algorithm 360: shortest path forest with topological ordering","volume":"12","author":"Dial","year":"1969","journal-title":"Commun. ACM"},{"issue":"3","key":"10.1016\/0305-0548(83)90030-8_BIB186","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1002\/net.3230090304","article-title":"A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees","volume":"9","author":"Dial","year":"1979","journal-title":"Networks"},{"key":"10.1016\/0305-0548(83)90030-8_BIB187","series-title":"Computer Scheduling of Public Transport: Urban Passenger Vehicle and Crew Scheduling","first-page":"53","article-title":"The role of the systems department and the role of operations management in introducing computer assistance to bus scheduling","author":"Dickinson","year":"1981"},{"key":"10.1016\/0305-0548(83)90030-8_BIB188","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A note on two problems in connection with graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numer. Math."},{"issue":"4","key":"10.1016\/0305-0548(83)90030-8_BIB189","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0305-0548(76)90010-1","article-title":"Environmental inspection routes and the constrained traveling salesman problem","volume":"3","author":"Dinkel","year":"1976","journal-title":"Comput. Ops. Res."},{"issue":"1","key":"10.1016\/0305-0548(83)90030-8_BIB190","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1002\/net.3230110109","article-title":"A more compact formulation of the symmetric multiple traveling salesman problem with fixed charges","volume":"11","author":"Discenza","year":"1981","journal-title":"Networks"},{"key":"10.1016\/0305-0548(83)90030-8_BIB191","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1287\/opre.17.3.395","article-title":"An appraisal of some shortest-path algorithms","volume":"17","author":"Dreyfus","year":"1969","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB192","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0305-0548(80)90006-4","article-title":"School bus routes generator in urban surroundings","volume":"7","author":"Dulac","year":"1980","journal-title":"Comput. Ops. Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB193","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","article-title":"Paths, trees and flowers","volume":"17","author":"Edmonds","year":"1965","journal-title":"Can. J. Math."},{"key":"10.1016\/0305-0548(83)90030-8_BIB194","series-title":"The Chinese Postman's Problem","author":"Edmonds","year":"1965"},{"key":"10.1016\/0305-0548(83)90030-8_BIB195","series-title":"Mathematics of the Decision Sciences","article-title":"Matroid partition","author":"Edmonds","year":"1968"},{"key":"10.1016\/0305-0548(83)90030-8_BIB196","series-title":"Combinatorial structures and their Applications","first-page":"89","article-title":"Matching: a well-solved class of integer linear programs","author":"Edmonds","year":"1970"},{"key":"10.1016\/0305-0548(83)90030-8_BIB197","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/BF01580113","article-title":"Matching, Euler tours, and the Chinese postman","volume":"5","author":"Edmonds","year":"1973","journal-title":"Math. Prog."},{"key":"10.1016\/0305-0548(83)90030-8_BIB198","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1145\/321694.321699","article-title":"Theoretical improvements in algorithmic efficiency for network flow problems","volume":"19","author":"Edmonds","year":"1972","journal-title":"J. ACM"},{"key":"10.1016\/0305-0548(83)90030-8_BIB199","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1287\/opre.14.3.361","article-title":"A branch and bound algorithm for plant location","volume":"14","author":"Effroymson","year":"1966","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB200","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1287\/mnsc.17.5.259","article-title":"The loading problem","volume":"17","author":"Eilon","year":"1971","journal-title":"Management Sci."},{"key":"10.1016\/0305-0548(83)90030-8_BIB201","series-title":"Distribution Management: Mathematical Modeling and Practical Analysis","author":"Eilon","year":"1971"},{"issue":"1","key":"10.1016\/0305-0548(83)90030-8_BIB202","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1287\/moor.4.1.39","article-title":"A strongly convergent primal algorithm for generalized networks","volume":"4","author":"Elam","year":"1979","journal-title":"Math. Ops Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB203","article-title":"A mathematical model for optimizing the assignment of man and machine in public transit \u201crun cutting\u201d","author":"Elias","year":"1966","journal-title":"West Virginia University, Engineering Experiment Station, Bulletin No. 81"},{"key":"10.1016\/0305-0548(83)90030-8_BIB204","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.17.1.1","article-title":"The theory of networks and management science","volume":"17","author":"Elmaghraby","year":"1970","journal-title":"Management Sci."},{"key":"10.1016\/0305-0548(83)90030-8_BIB205","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1287\/mnsc.17.2.B54","article-title":"The theory of networks and management science","volume":"17","author":"Elmaghraby","year":"1970","journal-title":"Management Sci."},{"key":"10.1016\/0305-0548(83)90030-8_BIB206","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1038\/scientificamerican0753-66","article-title":"The Konigsberg bridges","volume":"189","author":"Euler","year":"1953","journal-title":"Scientific American"},{"key":"10.1016\/0305-0548(83)90030-8_BIB207","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1287\/opre.11.3.399","article-title":"Generalized Lagrange multiplier method for solving problems of optimum allocation of resources","volume":"11","author":"Everett","year":"1963","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB208","article-title":"A combined vehicle routing and inventory allocation problem","author":"Federgruen","year":"1980"},{"key":"10.1016\/0305-0548(83)90030-8_BIB209","article-title":"Solution Techniques for Stationary and Time Varying Traveling Salesman Problems","author":"Felts","year":"1970"},{"issue":"10","key":"10.1016\/0305-0548(83)90030-8_BIB210","first-page":"28","article-title":"Controlling fixed-route operations","volume":"6","author":"Ferebee","year":"1974","journal-title":"Ind. Engng"},{"issue":"1","key":"10.1016\/0305-0548(83)90030-8_BIB211","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1287\/mnsc.3.1.45","article-title":"The allocation of aircraft to routes\u2014an example of linear programming under uncertain demand","volume":"3","author":"Ferguson","year":"1956","journal-title":"Management Sci."},{"key":"10.1016\/0305-0548(83)90030-8_BIB212","series-title":"presented at the IX Int. Symp. Math. Prog.","article-title":"A sub-optimal algorithm to solve a large scale 0\u20131 programming problem","author":"Ferland","year":"1979"},{"key":"10.1016\/0305-0548(83)90030-8_BIB213","article-title":"A simplex-type approach to solve the engine scheduling problem","author":"Ferland","year":"1980","journal-title":"University of Montreal Transportation Research Center Publication No. 157"},{"key":"10.1016\/0305-0548(83)90030-8_BIB214","article-title":"A network model for bidline generation","author":"Finnegan","year":"1977"},{"issue":"1","key":"10.1016\/0305-0548(83)90030-8_BIB215","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.26.1.1","article-title":"Worst-case analysis of heuristic algorithms","volume":"26","author":"Fisher","year":"1980","journal-title":"Management Sci."},{"key":"10.1016\/0305-0548(83)90030-8_BIB216","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.27.1.1","article-title":"The Lagrangian relaxation method for solving integer programming problems","volume":"27","author":"Fisher","year":"1981","journal-title":"Management Sci."},{"issue":"1","key":"10.1016\/0305-0548(83)90030-8_BIB217","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1287\/opre.26.1.166","article-title":"An algorithm for the space-shuttle scheduling problem","volume":"26","author":"Fisher","year":"1978","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB218","article-title":"A decomposition algorithm for large-scale vehicle routing","author":"Fisher","year":"1978"},{"issue":"2","key":"10.1016\/0305-0548(83)90030-8_BIB219","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1002\/net.3230110205","article-title":"A generalized assignment heuristic for vehicle routing","volume":"11","author":"Fisher","year":"1981","journal-title":"Networks"},{"key":"10.1016\/0305-0548(83)90030-8_BIB220","unstructured":"M. Fisher and R. Jaikumar, Private Communication (1980)."},{"key":"10.1016\/0305-0548(83)90030-8_BIB221","series-title":"Proc. National Council of Physical Distribution Management","first-page":"645","article-title":"The impact of advanced technologies in inventory management","author":"Fisher","year":"1981"},{"issue":"4","key":"10.1016\/0305-0548(83)90030-8_BIB222","doi-asserted-by":"crossref","first-page":"799","DOI":"10.1287\/opre.27.4.799","article-title":"An analysis of approximations for finding a maximum weight Hamiltonian circuit","volume":"27","author":"Fisher","year":"1979","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB223","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1137\/0127003","article-title":"Constructive duality in integer programming","volume":"27","author":"Fisher","year":"1974","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0305-0548(83)90030-8_BIB224","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1287\/opre.4.1.61","article-title":"The traveling salesman problem","volume":"4","author":"Flood","year":"1956","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB225","first-page":"121","article-title":"The engine scheduling problem in a railway network","volume":"14","author":"Florian","year":"1976","journal-title":"INFOR J."},{"issue":"12","key":"10.1016\/0305-0548(83)90030-8_BIB226","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1145\/355588.365103","article-title":"Algorithm 245: Treesort 3","volume":"7","author":"Floyd","year":"1964","journal-title":"Commun. ACM"},{"key":"10.1016\/0305-0548(83)90030-8_BIB227","series-title":"Flows in Networks","author":"Ford","year":"1962"},{"key":"10.1016\/0305-0548(83)90030-8_BIB228","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1057\/jors.1976.63","article-title":"An integer programming approach to the vehicle scheduling problem","volume":"27","author":"Foster","year":"1976","journal-title":"Ops Res. Quart."},{"key":"10.1016\/0305-0548(83)90030-8_BIB229","doi-asserted-by":"crossref","first-page":"546","DOI":"10.1287\/opre.17.3.546","article-title":"Finding a minimal cost to time ratio circuit","volume":"17","author":"Fox","year":"1969","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB230","doi-asserted-by":"crossref","first-page":"686","DOI":"10.1287\/opre.26.5.686","article-title":"Data structures and computer science techniques in operations research","volume":"26","author":"Fox","year":"1978","journal-title":"Ops Res."},{"issue":"4","key":"10.1016\/0305-0548(83)90030-8_BIB231","doi-asserted-by":"crossref","first-page":"1018","DOI":"10.1287\/opre.28.4.1018","article-title":"An n-constraint formulation of the (time dependent) traveling salesman problem","volume":"28","author":"Fox","year":"1980","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB232","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1145\/322139.322150","article-title":"Approximation algorithms for some postman problems","volume":"26","author":"Frederickson","year":"1979","journal-title":"J. ACM"},{"issue":"2","key":"10.1016\/0305-0548(83)90030-8_BIB233","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1137\/0207017","article-title":"Approximation algorithms for some routing problems","volume":"7","author":"Frederickson","year":"1978","journal-title":"SIAM J. Computing"},{"key":"10.1016\/0305-0548(83)90030-8_BIB234","first-page":"94","article-title":"Worst-case analysis of algorithms for travelling salesman problems","volume":"32","author":"Frieze","year":"1978","journal-title":"Ops Res. Verfahren"},{"key":"10.1016\/0305-0548(83)90030-8_BIB235","article-title":"An extension of Christofides heuristic to the K-person travelling salesman problem","author":"Frieze","year":"1980"},{"issue":"1","key":"10.1016\/0305-0548(83)90030-8_BIB236","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1002\/net.3230120103","article-title":"On the worst-case performance of some algorithms for the asymmetric traveling salesman problem","volume":"12","author":"Frieze","year":"1982","journal-title":"Networks"},{"key":"10.1016\/0305-0548(83)90030-8_BIB237","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1137\/0109002","article-title":"An out-of-kilter method for minimal cost flow problems","volume":"9","author":"Fulkerson","year":"1961","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"10.1016\/0305-0548(83)90030-8_BIB238","article-title":"An overview of vehicular scheduling problems","author":"Gabbay","year":"1974","journal-title":"M.I.T. Operations Research Center Technical Report, No. 103"},{"issue":"2","key":"10.1016\/0305-0548(83)90030-8_BIB239","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1145\/321941.321942","article-title":"An efficient implementation of Edmond's algorithm for maximum matching on graphs","volume":"23","author":"Gabow","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/0305-0548(83)90030-8_BIB240","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1002\/net.3230080304","article-title":"A good algorithm for smallest spanning trees with a degree constraint","volume":"8","author":"Gabow","year":"1978","journal-title":"Networks"},{"key":"10.1016\/0305-0548(83)90030-8_BIB241","series-title":"Proc. 8th SIGACT Symp. on the Theory of Computing","first-page":"10","article-title":"Some NP-complete geometric problems","author":"Garey","year":"1976"},{"key":"10.1016\/0305-0548(83)90030-8_BIB242","series-title":"Computer and Intractibility: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"issue":"1","key":"10.1016\/0305-0548(83)90030-8_BIB243","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1287\/opre.21.1.340","article-title":"On partitioning the feasible set in a branch-and-bound algorithm for the asymmetric traveling salesman problem","volume":"2","author":"Garfinkel","year":"1973","journal-title":"Ops Res"},{"issue":"5","key":"10.1016\/0305-0548(83)90030-8_BIB244","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1287\/opre.25.5.741","article-title":"Minimizing wallpaper waste, Part 1. A class of traveling salesman problems","volume":"25","author":"Garfinkel","year":"1977","journal-title":"Ops Res."},{"issue":"3","key":"10.1016\/0305-0548(83)90030-8_BIB245","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1145\/322077.322086","article-title":"The bottleneck traveling salesman problem: algorithms and probabilistic analysis","volume":"25","author":"Garfinkel","year":"1978","journal-title":"J. ACM"},{"key":"10.1016\/0305-0548(83)90030-8_BIB246","series-title":"Integer Programming","author":"Garfinkel","year":"1972"},{"key":"10.1016\/0305-0548(83)90030-8_BIB247","series-title":"Perspectives on Optimization","article-title":"Optimal set covering: a survey","author":"Garfinkel","year":"1972"},{"key":"10.1016\/0305-0548(83)90030-8_BIB248","doi-asserted-by":"crossref","first-page":"848","DOI":"10.1287\/opre.17.5.848","article-title":"The set partitioning problem: set covering with equality constraints","volume":"17","author":"Garfinkel","year":"1969","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB249","series-title":"Proc. Int. Symp. on Large Engineering Systems","article-title":"Modelling and optimization for transportation systems planning and operations","author":"Gartner","year":"1976"},{"key":"10.1016\/0305-0548(83)90030-8_BIB250","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1287\/mnsc.3.4.407","article-title":"Applications of vehicle routing in the oil industry","volume":"3","author":"Garvin","year":"1957","journal-title":"Management Sci."},{"key":"10.1016\/0305-0548(83)90030-8_BIB251","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1057\/jors.1967.44","article-title":"Bases for vehicle fleet scheduling","volume":"18","author":"Gaskell","year":"1967","journal-title":"Op. Res. Quart."},{"key":"10.1016\/0305-0548(83)90030-8_BIB252","article-title":"WMATA bus operating cost model","author":"Gavin","year":"1974"},{"key":"10.1016\/0305-0548(83)90030-8_BIB253","doi-asserted-by":"crossref","first-page":"704","DOI":"10.1287\/mnsc.22.6.704","article-title":"A note on the formulation of the M-salesman traveling salesman problem","volume":"22","author":"Gavish","year":"1976","journal-title":"Management Sci."},{"key":"10.1016\/0305-0548(83)90030-8_BIB254","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0305-0548(78)90018-7","article-title":"On obtaining the \u2018best\u2019 multipliers for a Lagrangean relaxation for integer programming","volume":"5","author":"Gavish","year":"1978","journal-title":"Comput. Ops Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB255","article-title":"Formulations and algorithms for the capacitated minimal directed tree problem","author":"Gavish","year":"1980"},{"key":"10.1016\/0305-0548(83)90030-8_BIB256","doi-asserted-by":"crossref","unstructured":"B. Gavish, Topological design of centralized computer networks-formulations and algorithms. Networks (to appear).","DOI":"10.1002\/net.3230120402"},{"key":"10.1016\/0305-0548(83)90030-8_BIB257","article-title":"The travelling salesman problem and related problems","author":"Gavish","year":"1978"},{"key":"10.1016\/0305-0548(83)90030-8_BIB258","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1287\/trsc.8.1.13","article-title":"An algorithm for combining truck trips","volume":"8","author":"Gavish","year":"1974","journal-title":"Transportation Sci."},{"key":"10.1016\/0305-0548(83)90030-8_BIB259","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0305-0548(78)90006-0","article-title":"Assigning buses to schedules in a metropolitan area","volume":"5","author":"Gavish","year":"1978","journal-title":"Comput. Ops Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB260","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1016\/0377-2217(79)90098-5","article-title":"An Approach for solving a class of transportation scheduling problems","volume":"3","author":"Gavish","year":"1978","journal-title":"European J. Op. Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB261","series-title":"Mathematical formulations for the dial-a-ride problem","author":"Gavish","year":"1979"},{"key":"10.1016\/0305-0548(83)90030-8_BIB262","article-title":"O(N2) Algorithms for sensitivity analysis of minimal spanning trees and related subgraphs","author":"Gavish","year":"1979"},{"key":"10.1016\/0305-0548(83)90030-8_BIB263","article-title":"An optimal method for the multiple travelling salesman problem","author":"Gavish","year":"1980","journal-title":"University of Rochester, Graduate School of Management, Report No. 8027"},{"issue":"4","key":"10.1016\/0305-0548(83)90030-8_BIB264","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1080\/05695557808975227","article-title":"An industrial application of the traveling salesman's subtour problem","volume":"10","author":"Gensch","year":"1978","journal-title":"AIIE Trans."},{"key":"10.1016\/0305-0548(83)90030-8_BIB265","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/BFb0120690","article-title":"Lagrangian relaxation for integer programming","volume":"2","author":"Geoffrion","year":"1974","journal-title":"Math. Prog. Study"},{"issue":"2","key":"10.1016\/0305-0548(83)90030-8_BIB266","article-title":"A guide to computer-assisted methods for distribution system planning","volume":"16","author":"Geoffrion","year":"1975","journal-title":"Sloan Management Rev."},{"issue":"2","key":"10.1016\/0305-0548(83)90030-8_BIB267","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1080\/05695557908974448","article-title":"Making better use of optimization capability in distribution systems planning","volume":"11","author":"Geoffrion","year":"1979","journal-title":"AIIE Trans."},{"key":"10.1016\/0305-0548(83)90030-8_BIB268","doi-asserted-by":"crossref","first-page":"822","DOI":"10.1287\/mnsc.20.5.822","article-title":"Multicommodity distribution system design by Benders decomposition","volume":"20","author":"Geoffrion","year":"1974","journal-title":"Management Sci."},{"key":"10.1016\/0305-0548(83)90030-8_BIB269","series-title":"Presented at the 18th AGIFORS Symposium","article-title":"A new algorithm for very large crew pairing problems","author":"Gerbracht","year":"1978"},{"key":"10.1016\/0305-0548(83)90030-8_BIB270","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1287\/trsc.11.1.20","article-title":"Constructing an optimal fleet for a transportation schedule","volume":"11","author":"Gertsbach","year":"1977","journal-title":"Transportation Sci."},{"key":"10.1016\/0305-0548(83)90030-8_BIB271","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1287\/opre.26.1.68","article-title":"Minimal resources for fixed and variable job schedules","volume":"26","author":"Gertsbach","year":"1978","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB272","article-title":"A more compact transformation of the symmetric multiple traveling salesman problem with fixed charges","author":"Gheysens","year":"1982"},{"key":"10.1016\/0305-0548(83)90030-8_BIB273","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1016\/0305-0483(76)90097-9","article-title":"Multi-terminal vehicle-dispatch algorithm","volume":"4","author":"Gillett","year":"1976","journal-title":"Omega"},{"key":"10.1016\/0305-0548(83)90030-8_BIB274","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1287\/opre.22.2.340","article-title":"A heuristic algorithm for the vehicle dispatch problem","volume":"22","author":"Gillett","year":"1974","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB275","series-title":"Revenues and operating costs","author":"W. Gilman and Company","year":"1971"},{"issue":"5","key":"10.1016\/0305-0548(83)90030-8_BIB276","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1287\/opre.12.5.655","article-title":"Sequencing a one state-variable machine: a solvable case of the traveling salesman problem","volume":"12","author":"Gilmore","year":"1964","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB277","doi-asserted-by":"crossref","DOI":"10.6028\/NBS.TN.772","article-title":"performance comparison of labeling algorithms for calculating shortest path trees","author":"Gilsinn","year":"1973"},{"key":"10.1016\/0305-0548(83)90030-8_BIB278","article-title":"Finding an optimal edge-covering tour of a connected graph","author":"Glover","year":"1967"},{"key":"10.1016\/0305-0548(83)90030-8_BIB279","article-title":"Minimum complete matchings","author":"Glover","year":"1967"},{"issue":"3","key":"10.1016\/0305-0548(83)90030-8_BIB280","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1002\/net.3230040302","article-title":"Implementation and computational comparisons of primal, dual, and primal-dual computer codes for minimum cost network flow problems","volume":"4","author":"Glover","year":"1974","journal-title":"Networks"},{"issue":"4","key":"10.1016\/0305-0548(83)90030-8_BIB281","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1287\/trsc.7.4.351","article-title":"A note on computational simplifications in solving generalized transportation problems","volume":"7","author":"Glover","year":"1973","journal-title":"Transportation Sci."},{"key":"10.1016\/0305-0548(83)90030-8_BIB282","series-title":"Combinatorial Programming: Methods and Applications","first-page":"191","article-title":"Finding minimum spanning trees with fixed number of links at a node","author":"Glover","year":"1975"},{"issue":"3","key":"10.1016\/0305-0548(83)90030-8_BIB283","first-page":"293","article-title":"Augmented threaded index method for network optimization","volume":"12","author":"Glover","year":"1974","journal-title":"INFOR"},{"issue":"4","key":"10.1016\/0305-0548(83)90030-8_BIB284","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1287\/trsc.7.4.377","article-title":"Extensions of the augmented predecessor index method to generalized network problems","volume":"7","author":"Glover","year":"1974","journal-title":"Transportation Sci."},{"key":"10.1016\/0305-0548(83)90030-8_BIB285","series-title":"Preprints, Workshop on Automated techniques for Scheduling of Vehicle Operators for Urban Public Transportation Services","article-title":"An examination of the run cutting and scheduling (RUCUS) system\u2014a case analysis","author":"Goeddel","year":"1975"},{"key":"10.1016\/0305-0548(83)90030-8_BIB286","doi-asserted-by":"crossref","DOI":"10.21236\/ADA013639","article-title":"Vehicle routing problems: formulations and heuristic solution techniques","author":"Golden","year":"1975"},{"key":"10.1016\/0305-0548(83)90030-8_BIB287","article-title":"Large scale vehicle routing and related combinatorial problems","author":"Golden","year":"1976"},{"issue":"6","key":"10.1016\/0305-0548(83)90030-8_BIB288","doi-asserted-by":"crossref","first-page":"1164","DOI":"10.1287\/opre.24.6.1164","article-title":"Shortest path algorithms: a comparison","volume":"24","author":"Golden","year":"1976","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB289","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1080\/05695557708975144","article-title":"Evaluating a sequential vehicle routing algorithm","volume":"9","author":"Golden","year":"1977","journal-title":"AIIE Trans."},{"key":"10.1016\/0305-0548(83)90030-8_BIB290","first-page":"255","article-title":"Statistical Estimation for combinatorial decision problems","volume":"Vol. 1","author":"Golden","year":"1978"},{"key":"10.1016\/0305-0548(83)90030-8_BIB291","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1002\/net.3230070303","article-title":"A statistical approach to the TSP","volume":"7","author":"Golden","year":"1977","journal-title":"Networks"},{"key":"10.1016\/0305-0548(83)90030-8_BIB292","series-title":"Computers and Mathematical Programming","first-page":"233","article-title":"Recent developments in vehicle routing","author":"Golden","year":"1978"},{"issue":"4","key":"10.1016\/0305-0548(83)90030-8_BIB293","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1080\/03610917808812084","article-title":"Point estimation of a global optimum for large combinatorial problems","volume":"B7","author":"Golden","year":"1978","journal-title":"Commun. Statistics"},{"issue":"1","key":"10.1016\/0305-0548(83)90030-8_BIB294","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1002\/nav.3800260108","article-title":"Interval estimation of a global optimum for large combinatorial problems","volume":"26","author":"Golden","year":"1977","journal-title":"Naval Res. Logistics Quart."},{"key":"10.1016\/0305-0548(83)90030-8_BIB295","article-title":"Listings and documentation for selected network optimization computer codes","author":"Golden","year":"1981"},{"key":"10.1016\/0305-0548(83)90030-8_BIB296","article-title":"The fleet size and mix vehicle routing problem","author":"Golden","year":"1982"},{"issue":"4","key":"10.1016\/0305-0548(83)90030-8_BIB297","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1002\/net.3230080404","article-title":"Shortest paths with Euclidean distances: an explanatory model","volume":"8","author":"Golden","year":"1978","journal-title":"Networks"},{"key":"10.1016\/0305-0548(83)90030-8_BIB298","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0305-0548(81)90035-6","article-title":"Current and future research directions in network optimization","volume":"8","author":"Golden","year":"1981","journal-title":"Comput. Ops Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB299","series-title":"Proc. of 1978 Transportation and Logistics Educators Conference","first-page":"11","article-title":"Solving large distribution-routing problems efficiently","author":"Golden","year":"1978"},{"key":"10.1016\/0305-0548(83)90030-8_BIB300","article-title":"Network analysis","author":"Golden","year":"1980"},{"key":"10.1016\/0305-0548(83)90030-8_BIB301","series-title":"Proc. of 1979 Northeast AIDS Conference","first-page":"71","article-title":"Solving large distribution-routing problems efficiently","author":"Golden","year":"1979"},{"issue":"3","key":"10.1016\/0305-0548(83)90030-8_BIB302","doi-asserted-by":"crossref","first-page":"694","DOI":"10.1287\/opre.28.3.694","article-title":"Approximate traveling salesman algorithms","volume":"28","author":"Golden","year":"1980","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB303","article-title":"Computational experiments with algorithms for a class of routing problems","author":"Golden","year":"1981"},{"issue":"4","key":"10.1016\/0305-0548(83)90030-8_BIB304","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1016\/0305-0483(81)90087-6","article-title":"Two generalizations of the traveling salesman problem","volume":"9","author":"Golden","year":"1981","journal-title":"Omega"},{"key":"10.1016\/0305-0548(83)90030-8_BIB305","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1002\/net.3230070204","article-title":"Deterministic network optimization\u2014a bibliography","volume":"7","author":"Golden","year":"1977","journal-title":"Networks"},{"key":"10.1016\/0305-0548(83)90030-8_BIB306","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1002\/net.3230070203","article-title":"Implementing vehicle routing algorithms","volume":"7","author":"Golden","year":"1977","journal-title":"Networks"},{"key":"10.1016\/0305-0548(83)90030-8_BIB307","series-title":"Computer Science and Statistics: Tenth Annual Symposium on the Interface","first-page":"252","article-title":"Vehicle routing with probabilistic demands","author":"Golden","year":"1978"},{"key":"10.1016\/0305-0548(83)90030-8_BIB308","article-title":"The empirical analysis of TSP heuristics","author":"Golden","year":"1981"},{"key":"10.1016\/0305-0548(83)90030-8_BIB309","first-page":"276","article-title":"A curve-fitting experiment in estimating optimal solution values to traveling salesman problems","volume":"Vol. 2","author":"Golden","year":"1981"},{"issue":"3","key":"10.1016\/0305-0548(83)90030-8_BIB310","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1002\/net.3230110308","article-title":"Capacitated arc routing problems","volume":"11","author":"Golden","year":"1981","journal-title":"Networks"},{"issue":"2","key":"10.1016\/0305-0548(83)90030-8_BIB311","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1080\/05695557908974449","article-title":"A framework of probabilistic vehicle routing","volume":"11","author":"Golden","year":"1979","journal-title":"AIEE Trans."},{"key":"10.1016\/0305-0548(83)90030-8_BIB312","unstructured":"D. Goren, Schneider Transport, Green Bay, Wisconsin, Personal communication (1980)."},{"key":"10.1016\/0305-0548(83)90030-8_BIB313","article-title":"On the scheduling of railroad freight operations","author":"Gorenstein","year":"1971"},{"key":"10.1016\/0305-0548(83)90030-8_BIB314","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","article-title":"Optimization and approximation in deterministic sequencing and scheduling: a survey","volume":"5","author":"Graham","year":"1979","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0305-0548(83)90030-8_BIB315","series-title":"National Meeting Colorado Springs","article-title":"An optimization-based approach to vehicle routing","volume":"Vol. 10.","author":"Graves","year":"1980"},{"key":"10.1016\/0305-0548(83)90030-8_BIB316","article-title":"Scheduling and dispatching policies in transportation systems","author":"Greenwood","year":"1967"},{"key":"10.1016\/0305-0548(83)90030-8_BIB317","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/BFb0120887","article-title":"On the symmetric traveling salesman problem: solution of 120-city problem","volume":"12","author":"Gr\u00f6tschel","year":"1980","journal-title":"Math. Prog. Study"},{"key":"10.1016\/0305-0548(83)90030-8_BIB318","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1287\/moor.5.2.285","article-title":"On the monotone symmetric travelling salesman problem: hypohamiltonian\/hypotraceable graphs and facets","volume":"5","author":"Gr\u00f6tschel","year":"1980","journal-title":"Math. Ops Res."},{"issue":"3","key":"10.1016\/0305-0548(83)90030-8_BIB319","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01582116","article-title":"On the symmetric traveling salesman problem I: inequalities","volume":"16","author":"Gr\u00f6tschel","year":"1979","journal-title":"Math. Prog."},{"issue":"3","key":"10.1016\/0305-0548(83)90030-8_BIB320","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/BF01582117","article-title":"On the symmetric traveling salesman problem II: Lifting theorems and facets","volume":"16","author":"Gr\u00f6tschel","year":"1979","journal-title":"Math. Prog."},{"key":"10.1016\/0305-0548(83)90030-8_BIB321","series-title":"Preprints, Workshop on Automated Techniques for Scheduling of Vehicle Operators for Urban Public Transportation Services","article-title":"Optimal scheduling of tours and days off","author":"Guha","year":"1975"},{"issue":"4","key":"10.1016\/0305-0548(83)90030-8_BIB322","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0305-0548(78)90033-3","article-title":"A search algorithm for the traveling salesman problem","volume":"5","author":"Gupta","year":"1978","journal-title":"Comput. Ops Res."},{"issue":"3","key":"10.1016\/0305-0548(83)90030-8_BIB323","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1287\/opre.13.3.462","article-title":"Optimum distribution of switching centers in a communication network and some related graph theoretic problems","volume":"13","author":"Hakimi","year":"1965","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB324","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1287\/opre.12.3.450","article-title":"Optimum location of switching centers and the absolute centers and medians of a graph","volume":"12","author":"Hakimi","year":"1964","journal-title":"Ops Res."},{"issue":"1","key":"10.1016\/0305-0548(83)90030-8_BIB325","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1137\/0211003","article-title":"A fast algorithm for the Euclidean traveling salesman problem, optimal with probability one","volume":"11","author":"Halton","year":"1982","journal-title":"SIAM J. Computing"},{"key":"10.1016\/0305-0548(83)90030-8_BIB326","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1002\/nav.3800160307","article-title":"Time-minimizing transportation problems","volume":"16","author":"Hammer","year":"1969","journal-title":"Naval Res. Logistics Quart."},{"key":"10.1016\/0305-0548(83)90030-8_BIB327","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/BF01585505","article-title":"Improvements of the held-karp algorithm for the symmetric traveling salesman problem","volume":"7","author":"Hansen","year":"1974","journal-title":"Math. Prog."},{"key":"10.1016\/0305-0548(83)90030-8_BIB328","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/0305-0548(83)90030-8_BIB329","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1287\/opre.10.5.647","article-title":"On the relation between the traveling salesman problem and the longest path problem","volume":"10","author":"Hardgrave","year":"1962","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB330","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1287\/inte.9.2pt2.6","article-title":"A planning system for facilities and resources in distribution networks","volume":"9","author":"Harrison","year":"1979","journal-title":"Interfaces"},{"key":"10.1016\/0305-0548(83)90030-8_BIB331","series-title":"Proc. NATO Conf. on the Application of Operational Research to Transport Problems","article-title":"Computerized Scheduling of Sea-Going Tankers","author":"Hartley","year":"1972"},{"key":"10.1016\/0305-0548(83)90030-8_BIB332","series-title":"Computer Scheduling of Public Transport: Urban Passenger Vehicle and Crew Scheduling","first-page":"353","article-title":"A glossary of terms in bus and crew scheduling","author":"Hartley","year":"1981"},{"issue":"1","key":"10.1016\/0305-0548(83)90030-8_BIB333","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.5.1.1","article-title":"Fleet selection for public transportation routes","volume":"5","author":"Hauer","year":"1971","journal-title":"Transportation Sci."},{"issue":"4","key":"10.1016\/0305-0548(83)90030-8_BIB334","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/0041-1647(67)90129-3","article-title":"A multi-period truck delivery problem","volume":"1","author":"Hausman","year":"1967","journal-title":"Transportation Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB335","article-title":"The delivery problem","author":"Hays","year":"1967","journal-title":"Carnegie Institute of Technology, Management Science Research Report No. 106"},{"key":"10.1016\/0305-0548(83)90030-8_BIB336","first-page":"196","article-title":"A dynamic programming approach to sequencing problems","volume":"10","author":"Held","year":"1962","journal-title":"J. SIAM"},{"key":"10.1016\/0305-0548(83)90030-8_BIB337","doi-asserted-by":"crossref","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","article-title":"The traveling salesman problem and minimum spanning trees","volume":"18","author":"Held","year":"1970","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB338","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1007\/BF01584070","article-title":"The traveling salesman problem and minimum spanning trees Part II","volume":"1","author":"Held","year":"1971","journal-title":"Math. Prog."},{"key":"10.1016\/0305-0548(83)90030-8_BIB339","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/BF01580223","article-title":"Validation of subgradient optimization","volume":"6","author":"Held","year":"1974","journal-title":"Math. Prog."},{"key":"10.1016\/0305-0548(83)90030-8_BIB340","series-title":"Proportional rotating schedules","author":"Heller","year":"1969"},{"key":"10.1016\/0305-0548(83)90030-8_BIB341","series-title":"Preprints, Workshop on Automated Techniques for Scheduling of Vehicle Operators for Urban Public Transportation Services","article-title":"A system for computer design of proportional rotating work schedules","author":"Heller","year":"1975"},{"key":"10.1016\/0305-0548(83)90030-8_BIB342","series-title":"Preprints, Workshop on Automated Techniques for Scheduling of Vehicle Operators for Urban Public Transportation Services","article-title":"Relationships between the scheduling of telephone operators and public transportation vehicle drivers","author":"Henderson","year":"1975"},{"key":"10.1016\/0305-0548(83)90030-8_BIB343","article-title":"Evaluation of some heuristic look ahead rules for multiple terminal delivery problems","author":"Hering","year":"1970"},{"key":"10.1016\/0305-0548(83)90030-8_BIB344","series-title":"Preprints, Workshop on Automated Techniques for Scheduling of vehicle Operators for Urban Public Transportation Services","article-title":"Preparing duty rosters for bus routes by computer","author":"Heurgon","year":"1975"},{"key":"10.1016\/0305-0548(83)90030-8_BIB345","series-title":"Computer Scheduling of Public Transport: Urban Passenger and Crew Scheduling","first-page":"183","article-title":"Advances in computer assisted runcutting in North America","author":"Hildyard","year":"1981"},{"key":"10.1016\/0305-0548(83)90030-8_BIB346","article-title":"Structuring and solving the bank messenger vehicle scheduling problem","author":"Hill","year":"1977"},{"issue":"12","key":"10.1016\/0305-0548(83)90030-8_BIB347","first-page":"60","article-title":"Computer algorithm for messenger vehicle scheduling at Ohio National Bank","volume":"9","author":"Hill","year":"1977","journal-title":"Ind. Engng"},{"key":"10.1016\/0305-0548(83)90030-8_BIB348","first-page":"368","article-title":"A comparison of human decision makers and a computer algorithm for the traveling salesman problem","volume":"1","author":"Hill","year":"1979"},{"key":"10.1016\/0305-0548(83)90030-8_BIB349","first-page":"17","article-title":"RUCUS: a comparative status report and assessment","author":"Hinds","year":"1979","journal-title":"Transit J."},{"key":"10.1016\/0305-0548(83)90030-8_BIB350","article-title":"Improvements to the Clarke and Wright algorithm as applied to an airline scheduling problem","author":"Hinson","year":"1975"},{"key":"10.1016\/0305-0548(83)90030-8_BIB351","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1007\/BF01583786","article-title":"Worst case analysis of a class of set covering heuristics","volume":"23","author":"Ho","year":"1982","journal-title":"Math. Prog."},{"key":"10.1016\/0305-0548(83)90030-8_BIB352","series-title":"Computer Scheduling of Public Transport: Urban Passenger and Crew Scheduling","first-page":"35","article-title":"Computerized vehicle and driver scheduling for the Hamburger Hochbahn Aktiengesellschaft","author":"Hoffstadt","year":"1981"},{"key":"10.1016\/0305-0548(83)90030-8_BIB353","article-title":"The school transportation problem","author":"Holden","year":"1967"},{"issue":"1","key":"10.1016\/0305-0548(83)90030-8_BIB354","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1057\/jors.1976.8","article-title":"A vehicle scheduling procedure based upon savings and a solution perturbation scheme","volume":"27","author":"Holmes","year":"1976","journal-title":"Op. Res. Quart."},{"issue":"5","key":"10.1016\/0305-0548(83)90030-8_BIB355","doi-asserted-by":"crossref","first-page":"871","DOI":"10.1287\/opre.25.5.871","article-title":"A note on the symmetric multiple traveling salesman problem with fixed charges","volume":"25","author":"Hong","year":"1977","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB356","first-page":"93","article-title":"The travelling salesman problem and shortest n-paths","volume":"17","author":"Houck","year":"1980","journal-title":"Opsearch"},{"key":"10.1016\/0305-0548(83)90030-8_BIB357","article-title":"Analysis models for solid waste collection","author":"Hudson","year":"1973","journal-title":"M.I.T. Civil Engineering Report"},{"issue":"1","key":"10.1016\/0305-0548(83)90030-8_BIB358","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0041-1647(68)90005-1","article-title":"Commercial airline scheduling technique","volume":"2","author":"Hyman","year":"1968","journal-title":"Transportation Res."},{"issue":"3","key":"10.1016\/0305-0548(83)90030-8_BIB359","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1287\/opre.17.3.543","article-title":"Some comments on the traveling salesman problem","volume":"17","author":"Isaac","year":"1969","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB360","article-title":"Integer linear programming as an aid in solving the airline crew schedule planning problem","author":"Isleb","year":"1970"},{"key":"10.1016\/0305-0548(83)90030-8_BIB361","series-title":"Computer Scheduling of Public Transport: Urban Passenger Vehicle and Crew Scheduling","first-page":"337","article-title":"Attendance and rostering system","author":"Jachnik","year":"1981"},{"key":"10.1016\/0305-0548(83)90030-8_BIB362","series-title":"presented at the Third European Congress on Operational Research","article-title":"A comparative study of methods for solving a real life two-level distribution problem","author":"Jacobsen","year":"1979"},{"key":"10.1016\/0305-0548(83)90030-8_BIB363","series-title":"presented at the International Symposium on Location Decisions","article-title":"On the location of transfer points in a two-level newspaper delivery system\u2014a case study","author":"Jacobsen","year":"1978"},{"key":"10.1016\/0305-0548(83)90030-8_BIB364","series-title":"presented at the ORSA\/TIMS Meeting","article-title":"A heuristic algorithm for the multi vehicle many to many advanced request dial-a-ride problem, Version 2","author":"Jaw","year":"1981"},{"key":"10.1016\/0305-0548(83)90030-8_BIB365","series-title":"Preprints, Workshop on Automated Techniques for Scheduling of Vehicle Operators for Urban Public Transportation Services","article-title":"An automated technique for scheduling motormen and conductors for the New York City Subways","author":"Jenkins","year":"1975"},{"key":"10.1016\/0305-0548(83)90030-8_BIB366","doi-asserted-by":"crossref","first-page":"1219","DOI":"10.1287\/opre.28.5.1219","article-title":"Data-dependent bounds for heuristics to find a minimum weight Hamiltonian circuit","volume":"28","author":"Jonker","year":"1980","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB367","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","article-title":"Approximate Algorithms for Combinatorial Problems","volume":"9","author":"Johnson","year":"1974","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0305-0548(83)90030-8_BIB368","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1287\/opre.14.4.619","article-title":"Networks and basic solutions","volume":"14","author":"Johnson","year":"1966","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB369","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1287\/opre.28.3.623","article-title":"Bounding symmetric traveling salesman problems with an asymmetric assignment problem","volume":"28","author":"Jonker","year":"1980","journal-title":"Ops Res."},{"issue":"5","key":"10.1016\/0305-0548(83)90030-8_BIB370","doi-asserted-by":"crossref","first-page":"1086","DOI":"10.1287\/opre.28.5.1086","article-title":"Local search for the asymmetric traveling salesman problem","volume":"28","author":"Kanellakis","year":"1980","journal-title":"Ops Res."},{"issue":"6","key":"10.1016\/0305-0548(83)90030-8_BIB371","doi-asserted-by":"crossref","first-page":"1033","DOI":"10.1287\/opre.26.6.1033","article-title":"A preference order dynamic program for a stochastic traveling salesman problem","volume":"26","author":"Kao","year":"1978","journal-title":"Ops Res."},{"issue":"2","key":"10.1016\/0305-0548(83)90030-8_BIB372","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1287\/mnsc.10.2.225","article-title":"A heuristic approach to solving traveling salesman problems","volume":"10","author":"Karg","year":"1964","journal-title":"Management Sci."},{"key":"10.1016\/0305-0548(83)90030-8_BIB373","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1137\/0208045","article-title":"A patching algorithm for the nonsymmetric traveling salesman problem","volume":"8","author":"Karp","year":"1979","journal-title":"SIAM J. Comp."},{"key":"10.1016\/0305-0548(83)90030-8_BIB374","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1002\/net.1975.5.1.45","article-title":"On the computational complexity of combinatorial problems","volume":"5","author":"Karp","year":"1975","journal-title":"Networks"},{"key":"10.1016\/0305-0548(83)90030-8_BIB375","series-title":"Algorithms and Complexity","first-page":"1","article-title":"The probabilistic analysis of some combinatorial search algorithms","author":"Karp","year":"1976"},{"key":"10.1016\/0305-0548(83)90030-8_BIB376","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1287\/moor.2.3.209","article-title":"Probabilistic analysis of partitioning algorithms for the traveling salesman problem in the plane","volume":"2","author":"Karp","year":"1977","journal-title":"Math. Ops Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB377","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0305-0548(83)90030-8_BIB378","article-title":"Verfahren zur Losung minimaler perfekter Matching-probleme mittels kurzester erweiternder Pfade","author":"Kazakidis","year":"1979"},{"key":"10.1016\/0305-0548(83)90030-8_BIB379","article-title":"Improving productivity in physical distribution","author":"Kearney","year":"1980"},{"key":"10.1016\/0305-0548(83)90030-8_BIB380","series-title":"Computer Scheduling of Public Transport Urban Passenger Vehicle and Crew Scheduling","first-page":"125","article-title":"Automating trip scheduling and optimal vehicle assignments","author":"Keaveny","year":"1981"},{"key":"10.1016\/0305-0548(83)90030-8_BIB381","series-title":"Preprints, Workshop on Automated Techniques for Scheduling of Vehicle Operators for Urban Public Transportation Services","article-title":"Practical considerations in developing effective manpower and equipment schedules","author":"Kelly","year":"1975"},{"key":"10.1016\/0305-0548(83)90030-8_BIB382","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1002\/net.3230080203","article-title":"A mean-time comparison of algorithms for the all-pairs shortest path problem with arbitrary arc lengths","volume":"8","author":"Kelton","year":"1978","journal-title":"Networks"},{"key":"10.1016\/0305-0548(83)90030-8_BIB383","series-title":"Algorithms for Network Programming","author":"Kennington","year":"1980"},{"issue":"4","key":"10.1016\/0305-0548(83)90030-8_BIB384","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1002\/net.3230040403","article-title":"Computing capacitated minimal spanning trees efficiently","volume":"4","author":"Kershenbaum","year":"1974","journal-title":"Networks"},{"key":"10.1016\/0305-0548(83)90030-8_BIB385","series-title":"Proc. ACM Ann. Conf.","first-page":"518","article-title":"Computing minimum spanning trees efficiently","author":"Kershenbaum","year":"1972"},{"issue":"2","key":"10.1016\/0305-0548(83)90030-8_BIB386","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","article-title":"An efficient heuristic procedure for partitioning graphs","volume":"49","author":"Kershenbaum","year":"1970","journal-title":"Bell Systems Tech. J."},{"key":"10.1016\/0305-0548(83)90030-8_BIB387","article-title":"A minimal spanning tree and approximate tours for a traveling salesman","author":"Kim","year":"1975"},{"issue":"2","key":"10.1016\/0305-0548(83)90030-8_BIB388","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1057\/jors.1973.48","article-title":"The savings method for vehicle scheduling","volume":"24","author":"Kirby","year":"1973","journal-title":"Op. Res. Quart."},{"key":"10.1016\/0305-0548(83)90030-8_BIB389","article-title":"Optimization by simulated annealing","author":"Kirkpatrick","year":"1982","journal-title":"IBM Thomas J. Watson Research Center Research Report"},{"key":"10.1016\/0305-0548(83)90030-8_BIB390","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/moor.5.1.1","article-title":"Combinatorial optimization: what is the state of the art?","volume":"5","author":"Klee","year":"1980","journal-title":"Math. Ops Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB391","article-title":"The Tyagi algorithm for truck dispatching","author":"Klincewicz","year":"1975"},{"issue":"3","key":"10.1016\/0305-0548(83)90030-8_BIB392","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1057\/jors.1968.73","article-title":"Vehicle scheduling with timed and connected calls: a case study","volume":"19","author":"Knight","year":"1968","journal-title":"Op. Res. Quart."},{"key":"10.1016\/0305-0548(83)90030-8_BIB393","series-title":"Lecture at OR Conference","article-title":"The use of a heuristic tree search algorithm for vehicle routing and scheduling","author":"Knowles","year":"1967"},{"key":"10.1016\/0305-0548(83)90030-8_BIB394","volume":"Vol. 1","author":"Knuth","year":"1973"},{"key":"10.1016\/0305-0548(83)90030-8_BIB395","volume":"Vol. 3","author":"Knuth","year":"1973"},{"key":"10.1016\/0305-0548(83)90030-8_BIB396","series-title":"presented at the Nordic Operations Analysis Conference","article-title":"Bus crew scheduling at Helsinki City Transport","author":"Koljonen","year":"1977"},{"key":"10.1016\/0305-0548(83)90030-8_BIB397","series-title":"Preprints, Workshop on Automated Techniques for Scheduling of Vehicle Operators for Urban Public Transportation Services","article-title":"Automated formation of staff schedules and duty rosters","author":"Kregeloh","year":"1975"},{"key":"10.1016\/0305-0548(83)90030-8_BIB398","article-title":"The method of ellipses (MOE): A Vehicle selection heuristic for the GRASP system","author":"Krolak","year":"1980"},{"key":"10.1016\/0305-0548(83)90030-8_BIB399","series-title":"\u2018Taxi\u2019, a realistic advance reservation dial-a-ride algorithms","author":"Krolak","year":"1981"},{"key":"10.1016\/0305-0548(83)90030-8_BIB400","series-title":"Proc. AIDS National Conf.","article-title":"Three scheduling heuristics for 24 hour advance reservation paratransit systems","author":"Krolak","year":"1981"},{"key":"10.1016\/0305-0548(83)90030-8_BIB401","series-title":"Presented at the 7th Mathematical Symposium","article-title":"Efficient heuristics for solving large traveling salesman problems","author":"Krolak","year":"1970"},{"key":"10.1016\/0305-0548(83)90030-8_BIB402","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1145\/362588.362593","article-title":"A man-machine approach toward solving the traveling saleman problem","volume":"14","author":"Krolak","year":"1971","journal-title":"Commun. ACM"},{"key":"10.1016\/0305-0548(83)90030-8_BIB403","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1287\/trsc.6.2.149","article-title":"A man-machine approach toward solving the generalized truck dispatching problem","volume":"6","author":"Krolak","year":"1972","journal-title":"Transportation Sci."},{"key":"10.1016\/0305-0548(83)90030-8_BIB404","article-title":"A family of truck load clustering heuristics for solving vehicle scheduling problems","author":"Krolak","year":"1978"},{"key":"10.1016\/0305-0548(83)90030-8_BIB405","series-title":"Heuristic programming applied to scheduling problems","author":"Krone","year":"1970"},{"key":"10.1016\/0305-0548(83)90030-8_BIB406","first-page":"48","article-title":"On the shortest spanning subtree of a graph and the traveling salesman problem","volume":"2","author":"Kruskal","year":"1956"},{"key":"10.1016\/0305-0548(83)90030-8_BIB407","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1287\/mnsc.9.4.643","article-title":"A heuristic program for locating warehouses","volume":"9","author":"Kuehn","year":"1963","journal-title":"Management Sci."},{"key":"10.1016\/0305-0548(83)90030-8_BIB408","unstructured":"H. Kuhn, The traveling salesman problem. The Proc. Sixth Symposium in Applied Mathematics of the American Mathematical Society. McGraw-Hill, New York (to appear)."},{"key":"10.1016\/0305-0548(83)90030-8_BIB409","article-title":"Implementing operations research: a strategy based on case studies","author":"Kursh","year":"1973"},{"issue":"3","key":"10.1016\/0305-0548(83)90030-8_BIB410","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0041-1647(77)90013-2","article-title":"Non-stop vs one stop flights","volume":"11","author":"Ladany","year":"1977","journal-title":"Transportation Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB411","series-title":"Presented at NCPDM Conference","article-title":"Customer service: meaning and measurement","author":"Lalonde","year":"1976"},{"issue":"4","key":"10.1016\/0305-0548(83)90030-8_BIB412","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1287\/trsc.4.4.403","article-title":"Comments on a heuristic algorithm for the multiple terminal delivery problem","volume":"4","author":"Lam","year":"1970","journal-title":"Transportation Sci."},{"key":"10.1016\/0305-0548(83)90030-8_BIB413","series-title":"Oregon. Computer Scheduling of Public Transport Urban Passenger Vehicle and crew Scheduling","first-page":"61","article-title":"A perspective on automated bus operator scheduling: five years experience in Portland","author":"Landis","year":"1981"},{"key":"10.1016\/0305-0548(83)90030-8_BIB414","doi-asserted-by":"crossref","first-page":"1017","DOI":"10.1057\/jors.1980.188","article-title":"A cutting planes algorithm for the m-saleman problem","volume":"31","author":"Laporte","year":"1980","journal-title":"J. Op. Res. Soc."},{"key":"10.1016\/0305-0548(83)90030-8_BIB415","article-title":"Subtour elimination algorithms for the symmetrical traveling salesman problem and its variants","author":"Laporte","year":"1980","journal-title":"University of Montreal Transportation Research Center Publication No. 161"},{"issue":"2","key":"10.1016\/0305-0548(83)90030-8_BIB416","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/0377-2217(81)90212-5","article-title":"An exact algorithm for minimizing routing and operating costs in depot location","volume":"6","author":"Laporte","year":"1981","journal-title":"European J. Op. Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB417","article-title":"The multi-depot traveling salesman problem","author":"Laporte","year":"1980","journal-title":"University of Montreal Transportation Research Center Publication No. 182"},{"key":"10.1016\/0305-0548(83)90030-8_BIB418","article-title":"Generalized traveling salesman problem through n sets of nodes: an integer programming approach","author":"Laporte","year":"1980","journal-title":"University of Montreal Transportation Research Center Publication No. 197"},{"key":"10.1016\/0305-0548(83)90030-8_BIB419","series-title":"Proc. Fifth AGIFORS Symp. Operations Research Division","first-page":"137","article-title":"A dynamic programming approach to airline scheduling","author":"Larson","year":"1965"},{"issue":"3","key":"10.1016\/0305-0548(83)90030-8_BIB420","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1002\/net.3230110307","article-title":"Finding minimum rectilinear distance paths in the presence of barriers","volume":"11","author":"Larson","year":"1981","journal-title":"Networks"},{"key":"10.1016\/0305-0548(83)90030-8_BIB421","series-title":"Urban Operations Research","author":"Larson","year":"1980"},{"key":"10.1016\/0305-0548(83)90030-8_BIB422","series-title":"Optimization Theory for Large Systems","author":"Lasdon","year":"1970"},{"key":"10.1016\/0305-0548(83)90030-8_BIB423","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/BF01584089","article-title":"A solvable case of the traveling salesman problem","volume":"1","author":"Lawler","year":"1971","journal-title":"Math. Prog."},{"key":"10.1016\/0305-0548(83)90030-8_BIB424","series-title":"Proc. Conf. on Periodic Optimization. CISM","article-title":"Optimal cycles in graphs and the minimal cost-to-time ratio problem","author":"Lawer","year":"1973"},{"key":"10.1016\/0305-0548(83)90030-8_BIB425","series-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler","year":"1976"},{"key":"10.1016\/0305-0548(83)90030-8_BIB426","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0167-5060(08)70830-6","article-title":"Shortest path and network flow algorithms","volume":"4","author":"Lawler","year":"1979","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0305-0548(83)90030-8_BIB427","article-title":"Interactive vehicle dispatching: a Hybrid approach","author":"Lawrence","year":"1980"},{"key":"10.1016\/0305-0548(83)90030-8_BIB428","doi-asserted-by":"crossref","unstructured":"J. Lawrence and K. Steiglitz, Randomized pattern search. IEEE Trans. Computers (to appear).","DOI":"10.1109\/TC.1972.5008979"},{"key":"10.1016\/0305-0548(83)90030-8_BIB429","series-title":"Proc. Second Int. Symp. on the Use of Cybernetics on the Railroads","first-page":"154","article-title":"Scheduling empty freight car fleets on the Louisville and Nashville Railroad","author":"Leddon","year":"1967"},{"key":"10.1016\/0305-0548(83)90030-8_BIB430","article-title":"Graphen Theorie in Planungs-und Touren Problemen","volume":"21","author":"Leibung","year":"1970"},{"issue":"4","key":"10.1016\/0305-0548(83)90030-8_BIB431","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0377-2217(78)90044-9","article-title":"On the solutions of stochastic traveling salesman problems","volume":"2","author":"Leipala","year":"1978","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/0305-0548(83)90030-8_BIB432","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1002\/net.3230060305","article-title":"On general routing Problems","volume":"6","author":"Lenstra","year":"1976","journal-title":"Networks"},{"issue":"4","key":"10.1016\/0305-0548(83)90030-8_BIB433","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1057\/jors.1975.151","article-title":"Some simple applications of the traveling salesman problem","volume":"24","author":"Lenstra","year":"1975","journal-title":"Op. Res. Quart."},{"key":"10.1016\/0305-0548(83)90030-8_BIB434","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/S0167-5060(08)70821-5","article-title":"Computational complexity of discrete optimization problems","volume":"4","author":"Lenstra","year":"1979","journal-title":"Ann. Discrete Math."},{"issue":"3","key":"10.1016\/0305-0548(83)90030-8_BIB435","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1016\/0377-2217(79)90145-0","article-title":"A characterization of linear admissible transformations for the m-traveling salesman problem: a result of Berenguer","volume":"3","author":"Lenstra","year":"1979","journal-title":"European J. Op. Res."},{"issue":"2","key":"10.1016\/0305-0548(83)90030-8_BIB436","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1002\/net.3230110211","article-title":"Complexity of vehicle routing and scheduling problems","volume":"11","author":"Lenstra","year":"1981","journal-title":"Networks"},{"key":"10.1016\/0305-0548(83)90030-8_BIB437","series-title":"Computer Scheduling of Public Transport: Urban Passenger Vehicle and Crew Scheduling","first-page":"259","article-title":"Hastus I: a mathematical programming approach to the bus driver scheduling problem","author":"Lessard","year":"1981"},{"key":"10.1016\/0305-0548(83)90030-8_BIB438","doi-asserted-by":"crossref","first-page":"660","DOI":"10.1016\/0305-0483(81)90056-6","article-title":"Heuristic vehicle scheduling","volume":"9","author":"Levary","year":"1981","journal-title":"Omega"},{"key":"10.1016\/0305-0548(83)90030-8_BIB439","article-title":"Crew scheduling on a transportation network","author":"Levin","year":"1966"},{"key":"10.1016\/0305-0548(83)90030-8_BIB440","article-title":"Some fleet routing and scheduling problems for air transportation systems","author":"Levin","year":"1969"},{"key":"10.1016\/0305-0548(83)90030-8_BIB441","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1287\/trsc.5.3.232","article-title":"Scheduling and fleet routing models for transportation systems","volume":"5","author":"Levin","year":"1971","journal-title":"Transportation Sci."},{"key":"10.1016\/0305-0548(83)90030-8_BIB442","series-title":"Applied Mathematics","article-title":"The fleet mix vehicle routing problem","author":"Levy","year":"1980"},{"key":"10.1016\/0305-0548(83)90030-8_BIB443","series-title":"Elements of the Theory of Computation","author":"Lewis","year":"1981"},{"key":"10.1016\/0305-0548(83)90030-8_BIB444","doi-asserted-by":"crossref","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","article-title":"Computer solutions of the traveling salesman problem","volume":"44","author":"Lin","year":"1965","journal-title":"Bell System Tech. J."},{"key":"10.1016\/0305-0548(83)90030-8_BIB445","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1002\/net.1975.5.1.33","article-title":"Heuristic programming as an aid to network design","volume":"5","author":"Lin","year":"1975","journal-title":"Networks"},{"key":"10.1016\/0305-0548(83)90030-8_BIB446","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","article-title":"An effective heuristic algorithm for the traveling salesman problem","volume":"21","author":"Lin","year":"1973","journal-title":"Op. Res."},{"issue":"6","key":"10.1016\/0305-0548(83)90030-8_BIB447","doi-asserted-by":"crossref","first-page":"972","DOI":"10.1287\/opre.11.6.972","article-title":"An algorithm for the traveling salesman problem","volume":"11","author":"Little","year":"1963","journal-title":"Ops. Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB448","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0377-2217(79)90099-7","article-title":"Procedures for traveling salseman problems with additional constraints","volume":"3","author":"Lokin","year":"1978","journal-title":"European J. Op. Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB449","series-title":"Proc. Tenth AGIFORS Symp. Operations Research Division, American Airlines","article-title":"CREATION\u2014a heuristic program for crew allocation","author":"Loo","year":"1970"},{"key":"10.1016\/0305-0548(83)90030-8_BIB450","article-title":"Extensions of the tanker scheduling problem","author":"Lubore","year":"1969"},{"issue":"4","key":"10.1016\/0305-0548(83)90030-8_BIB451","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1057\/jors.1972.73","article-title":"Vehicle scheduling\u2014a case study","volume":"23","author":"MacDonald","year":"1972","journal-title":"Op. Res. Quart."},{"key":"10.1016\/0305-0548(83)90030-8_BIB452","article-title":"Scheduling Vehicles in a Transportation Network, Operations Research Group","author":"MacDonald-Taylor","year":"1967"},{"key":"10.1016\/0305-0548(83)90030-8_BIB453","doi-asserted-by":"crossref","first-page":"13","DOI":"10.2307\/1248540","article-title":"Modern Methods for Local Delivery Route Design","volume":"29","author":"Maffei","year":"1965","journal-title":"Journal of Marketing"},{"key":"10.1016\/0305-0548(83)90030-8_BIB454","series-title":"Sparse Matrix Computations","first-page":"147","article-title":"Optimization For Sparse Systems","author":"Magnanti","year":"1976"},{"issue":"2","key":"10.1016\/0305-0548(83)90030-8_BIB455","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1002\/net.3230110209","article-title":"Combinatorial Optimization and Vehicle Fleet Planning: Perspectives and Prospects","volume":"11","author":"Magnanti","year":"1981","journal-title":"Networks"},{"key":"10.1016\/0305-0548(83)90030-8_BIB456","series-title":"Studies in Operations Management","article-title":"Transportation Planning: Network Models and Their Implementation","author":"Magnanti","year":"1978"},{"key":"10.1016\/0305-0548(83)90030-8_BIB457","doi-asserted-by":"crossref","first-page":"1195","DOI":"10.1287\/mnsc.22.11.1195","article-title":"Generalized Linear Programming Solves the Dual","volume":"11","author":"Magnanti","year":"1976","journal-title":"Management Science"},{"key":"10.1016\/0305-0548(83)90030-8_BIB458","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1287\/opre.29.3.464","article-title":"Accelerating Benders Decomposition: Algorithmic Enhancements and Model Selection Criteria","volume":"29","author":"Magnanti","year":"1981","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB459","doi-asserted-by":"crossref","first-page":"1622","DOI":"10.1287\/mnsc.24.15.1622","article-title":"On a Production Allocation and Distribution Problem","volume":"24","author":"Mairs","year":"1978","journal-title":"Management Science"},{"key":"10.1016\/0305-0548(83)90030-8_BIB460","article-title":"A heuristic solution to the M-postman's problem","author":"Male","year":"1973"},{"issue":"1","key":"10.1016\/0305-0548(83)90030-8_BIB461","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1002\/net.3230070107","article-title":"An improvement of Orloff's general routing problem","volume":"7","author":"Male","year":"1977","journal-title":"Networks"},{"key":"10.1016\/0305-0548(83)90030-8_BIB462","article-title":"Approximate solution of the traveling salesman problem by nonlocal, non-iterative methods","author":"Malone","year":"1978"},{"key":"10.1016\/0305-0548(83)90030-8_BIB463","series-title":"Preprints, Workshop on Automated Techniques for Scheduling of Vehicle Operators for Urban Public Transportation Services","article-title":"A general computer method for bus crew scheduling","author":"Manington","year":"1975"},{"key":"10.1016\/0305-0548(83)90030-8_BIB464","series-title":"Preprints, Workshop on Automated Techniques for Scheduling of Vehicle Operators for Urban Public Transportation Service","article-title":"Experiences with a bus scheduling algorithm which saves vehicles","author":"Manington","year":"1975"},{"key":"10.1016\/0305-0548(83)90030-8_BIB465","series-title":"Proc. of the 6th Ann. ACM Urban Symp.","article-title":"Routing for Muncipal Services","author":"Marks","year":"1971"},{"key":"10.1016\/0305-0548(83)90030-8_BIB466","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1061\/JUPDAJ.0000146","article-title":"Routing for public service vehicles","volume":"97","author":"Marks","year":"1971","journal-title":"J. Urban Planning Dev. Div.\u2014ASCE"},{"key":"10.1016\/0305-0548(83)90030-8_BIB467","series-title":"Proc. Paper 8027","first-page":"15","article-title":"Locational models: solid waste collection example","volume":"97","author":"Marks","year":"1971"},{"issue":"4","key":"10.1016\/0305-0548(83)90030-8_BIB468","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0377-2217(77)90095-9","article-title":"A network solution to a general vehicle scheduling problem","volume":"1","author":"Diez-Canedo","year":"1977","journal-title":"European J. Op. Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB469","doi-asserted-by":"crossref","first-page":"774","DOI":"10.1287\/mnsc.20.5.774","article-title":"An algorithm for large set partitioning problems","volume":"20","author":"Marsten","year":"1974","journal-title":"Management Sci."},{"key":"10.1016\/0305-0548(83)90030-8_BIB470","doi-asserted-by":"crossref","first-page":"1175","DOI":"10.1287\/mnsc.25.12.1175","article-title":"Crew planning at flying tiger: a successful application of integer programming","volume":"25","author":"Marsten","year":"1979","journal-title":"Management Sci."},{"issue":"2","key":"10.1016\/0305-0548(83)90030-8_BIB471","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1002\/net.3230110208","article-title":"Exact solution of crew scheduling problems using the set partitioning model: recent successful applications","volume":"11","author":"Marsten","year":"1981","journal-title":"Networks"},{"key":"10.1016\/0305-0548(83)90030-8_BIB472","article-title":"An L. P. algorithm for scheduling vehicles in a transportation network","author":"Martin-Lof","year":"1969"},{"issue":"2","key":"10.1016\/0305-0548(83)90030-8_BIB473","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1287\/trsc.4.2.159","article-title":"A branch-and-bound algorithm for determining the minimal fleet size of a transportation system","volume":"4","author":"Martin-Lof","year":"1970","journal-title":"Transportation Sci."},{"issue":"2","key":"10.1016\/0305-0548(83)90030-8_BIB474","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0305-0548(82)90013-2","article-title":"Controlling left and U-turns in the routing of refuse collection vehicles","volume":"9","author":"McBride","year":"1982","journal-title":"Comput. & Ops Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB475","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1287\/moor.4.4.414","article-title":"Combinatorial optimization with rational objective functions","volume":"4","author":"Megiddo","year":"1979","journal-title":"Math. Ops Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB476","first-page":"278","article-title":"Improvement on Graphic Programming","volume":"1","author":"Mei-Ko","year":"1962","journal-title":"Chinese Mathematics"},{"key":"10.1016\/0305-0548(83)90030-8_BIB477","first-page":"273","article-title":"Graphic programming using odd or even points","volume":"1","author":"Mei-Ko","year":"1962","journal-title":"Chinese Math."},{"key":"10.1016\/0305-0548(83)90030-8_BIB478","series-title":"Operational Distribution Research","author":"Mercer","year":"1978"},{"key":"10.1016\/0305-0548(83)90030-8_BIB479","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1111\/j.1540-5915.1972.tb00549.x","article-title":"A review of heuristic programming","volume":"3","author":"Michael","year":"1972","journal-title":"Decision Sci."},{"key":"10.1016\/0305-0548(83)90030-8_BIB480","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/BF01580682","article-title":"Interger programming approaches to the traveling salesman problem","volume":"10","author":"Miliotis","year":"1976","journal-title":"Math. Prog."},{"key":"10.1016\/0305-0548(83)90030-8_BIB481","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BF01609016","article-title":"Using cutting planes to solve the symmetric traveling salesman problem","volume":"15","author":"Miliotis","year":"1978","journal-title":"Math. Prog."},{"key":"10.1016\/0305-0548(83)90030-8_BIB482","article-title":"Computational comparison of two methods for finding the shortest complete cycle or circuit in a graph","author":"Miliotis","year":"1980","journal-title":"University of Montreal Transportation Research Center Publication No. 175"},{"key":"10.1016\/0305-0548(83)90030-8_BIB483","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1145\/321043.321046","article-title":"Integer programming formulation of travelling salesman problems","volume":"7","author":"Miller","year":"1960","journal-title":"J. Ass. Comput. Mach."},{"key":"10.1016\/0305-0548(83)90030-8_BIB484","series-title":"Preprints, Workshop on Automatic Techniques for Scheduling of Vehicle operators for Urban Public Transportation Services","article-title":"Relationships between automated scheduling techniques for nurses and public transportation vehicle operators","author":"Miller","year":"1975"},{"key":"10.1016\/0305-0548(83)90030-8_BIB485","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1287\/trsc.6.3.221","article-title":"A time-of-day model for aircraft scheduling","volume":"6","author":"Miller","year":"1972","journal-title":"Transportation Sci."},{"key":"10.1016\/0305-0548(83)90030-8_BIB486","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1287\/opre.6.3.329","article-title":"The hub operations scheduling problem","volume":"6","author":"Minas","year":"1958","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB487","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1287\/mnsc.25.7.643","article-title":"The Chinese postman problem for mixed networks","volume":"25","author":"Minieka","year":"1979","journal-title":"Management Sci."},{"key":"10.1016\/0305-0548(83)90030-8_BIB488","article-title":"Dial-a-bus: a prototype analysis","author":"M.I.T.","year":"1969","journal-title":"Final Report to U.S. Department of Housing and Urban Development"},{"key":"10.1016\/0305-0548(83)90030-8_BIB489","article-title":"Scheduling algorithms for a dial-a-bus system","author":"M.I.T.","year":"1970","journal-title":"Final Report to U.S. Department of Transportation"},{"key":"10.1016\/0305-0548(83)90030-8_BIB490","series-title":"Computer Scheduling of Public Transport: Urban Passenger Vehicle and Crew Scheduling","first-page":"281","article-title":"A computer based crew scheduling system using a mathematical programming approach","author":"Mitra","year":"1981"},{"key":"10.1016\/0305-0548(83)90030-8_BIB491","article-title":"Vehicle scheduling and driver run cutting (RUCUS) package user documentation","author":"The Mitre Corporation","year":"1974"},{"key":"10.1016\/0305-0548(83)90030-8_BIB492","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1057\/jors.1979.46","article-title":"A survey of local delivery vehicle routing methodology","volume":"30","author":"Mole","year":"1979","journal-title":"J. Op. Res. Soc."},{"key":"10.1016\/0305-0548(83)90030-8_BIB493","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1057\/jors.1976.95","article-title":"A sequential route-building algorithm employing a generalized savings criterion","volume":"27","author":"Mole","year":"1976","journal-title":"Op. Res. Quart."},{"key":"10.1016\/0305-0548(83)90030-8_BIB494","first-page":"10","article-title":"Scheduling manpower for service operations","author":"Monroe","year":"1970","journal-title":"Ind. Engng"},{"key":"10.1016\/0305-0548(83)90030-8_BIB495","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1016\/0305-0483(82)90104-9","article-title":"The urban postman","volume":"10","author":"Moon","year":"1982","journal-title":"Omega"},{"key":"10.1016\/0305-0548(83)90030-8_BIB496","article-title":"Scheduling of airline flight crews","author":"Moreland","year":"1966"},{"key":"10.1016\/0305-0548(83)90030-8_BIB497","series-title":"Proc. Int. Conf, on Trans. Res.","first-page":"757","article-title":"Schedule planning and timetable construction for suburban railways","author":"Morlok","year":"1974"},{"issue":"3","key":"10.1016\/0305-0548(83)90030-8_BIB498","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/BF01609034","article-title":"Testing of large-scale network optimization program","volume":"15","author":"Mulvey","year":"1978","journal-title":"Math. Prog."},{"key":"10.1016\/0305-0548(83)90030-8_BIB499","doi-asserted-by":"crossref","DOI":"10.21236\/AD0653103","article-title":"The symmetric assignment problem","author":"Murty","year":"1967"},{"key":"10.1016\/0305-0548(83)90030-8_BIB500","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1287\/trsc.3.2.164","article-title":"Scheduling local and express trains","volume":"3","author":"Nemhauser","year":"1969","journal-title":"Transportation Sci."},{"key":"10.1016\/0305-0548(83)90030-8_BIB501","doi-asserted-by":"crossref","first-page":"1413","DOI":"10.1287\/mnsc.20.11.1413","article-title":"Set partitioning and chain decomposition","volume":"20","author":"Nemhauser","year":"1974","journal-title":"Management Sci."},{"key":"10.1016\/0305-0548(83)90030-8_BIB502","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01588971","article-title":"An analysis of approximations for maximizing submodular set functions\u2014I","volume":"14","author":"Nemhauser","year":"1978","journal-title":"Math. Prog."},{"key":"10.1016\/0305-0548(83)90030-8_BIB503","series-title":"Traffic Flow","author":"Newell","year":"1980"},{"key":"10.1016\/0305-0548(83)90030-8_BIB504","article-title":"A school bus scheduling algorithm","author":"Newton","year":"1967"},{"key":"10.1016\/0305-0548(83)90030-8_BIB505","series-title":"Bus routing in a multi-school system","author":"Newton","year":"1970"},{"key":"10.1016\/0305-0548(83)90030-8_BIB506","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0038-0121(69)90051-2","article-title":"Design of school bus routes by computer","volume":"3","author":"Newton","year":"1969","journal-title":"Socio-Economie Planning Sci."},{"key":"10.1016\/0305-0548(83)90030-8_BIB507","author":"Newton","year":"1970"},{"key":"10.1016\/0305-0548(83)90030-8_BIB508","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0305-0548(74)90047-1","article-title":"Bus routing in a multi-school system","volume":"1","author":"Newton","year":"1974","journal-title":"Comput. & Ops Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB509","article-title":"Multi-depot vehicle routing problems","author":"Nguyen","year":"1975"},{"key":"10.1016\/0305-0548(83)90030-8_BIB510","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1057\/jors.1968.102","article-title":"A boundary method for planar traveling salesman problems","volume":"19","author":"Nicholson","year":"1968","journal-title":"Op. Res. Quart."},{"key":"10.1016\/0305-0548(83)90030-8_BIB511","article-title":"Optimization Techniques","volume":"Vol. 1","author":"Nicholson","year":"1971"},{"key":"10.1016\/0305-0548(83)90030-8_BIB512","series-title":"Combinatorial Algorithms","author":"Nijenhuis","year":"1975"},{"issue":"12","key":"10.1016\/0305-0548(83)90030-8_BIB513","first-page":"8","article-title":"An information system for vehicle scheduling","volume":"3","author":"Noonan","year":"1969","journal-title":"Software Age"},{"key":"10.1016\/0305-0548(83)90030-8_BIB514","doi-asserted-by":"crossref","first-page":"1208","DOI":"10.1287\/mnsc.23.11.1208","article-title":"Geometric approaches to solving the traveling salesman problem","volume":"23","author":"Norback","year":"1977","journal-title":"Management Sci."},{"key":"10.1016\/0305-0548(83)90030-8_BIB515","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1057\/jors.1979.77","article-title":"Heuristic for the Hamiltonian path problem in euclidean two space","volume":"30","author":"Norback","year":"1979","journal-title":"J. Op. Res. Soc."},{"key":"10.1016\/0305-0548(83)90030-8_BIB516","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1093\/comjnl\/10.4.374","article-title":"Spanning tree manipulation and the traveling salesman problem","volume":"10","author":"Obruca","year":"1966","journal-title":"Comp. J."},{"key":"10.1016\/0305-0548(83)90030-8_BIB517","article-title":"Design and analysis of heuristics for some routing and packing problems","author":"Ong","year":"1981"},{"key":"10.1016\/0305-0548(83)90030-8_BIB518","article-title":"Traveling salesman-type combinatorial problems and their relation to the logistics of blood banking","author":"Or","year":"1976"},{"key":"10.1016\/0305-0548(83)90030-8_BIB519","series-title":"Graphs and Their Uses","author":"Ore","year":"1963"},{"key":"10.1016\/0305-0548(83)90030-8_BIB520","article-title":"Minimizing the number of vehicles to meet a fixed periodic schedule: an application of periodic posets","author":"Orlin","year":"1980"},{"key":"10.1016\/0305-0548(83)90030-8_BIB521","article-title":"Minimum convex-cost dynamic network flows","author":"Orlin","year":"1980"},{"key":"10.1016\/0305-0548(83)90030-8_BIB522","series-title":"Routing and scheduling a fleet of vehicles: the school bus problem","author":"Orloff","year":"1973"},{"key":"10.1016\/0305-0548(83)90030-8_BIB523","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1002\/net.3230040105","article-title":"A fundamental problem in vehicle routing","volume":"4","author":"Orloff","year":"1974","journal-title":"Networks"},{"key":"10.1016\/0305-0548(83)90030-8_BIB524","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1002\/net.3230040205","article-title":"Routing a fleet of M vehicles to\/from a central facility","volume":"4","author":"Orloff","year":"1974","journal-title":"Networks"},{"issue":"3","key":"10.1016\/0305-0548(83)90030-8_BIB525","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1002\/net.3230060306","article-title":"On general routing problems: Comments","volume":"6","author":"Orloff","year":"1976","journal-title":"Networks"},{"key":"10.1016\/0305-0548(83)90030-8_BIB526","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1287\/trsc.10.2.149","article-title":"Route constrained fleet scheduling","volume":"10","author":"Orloff","year":"1976","journal-title":"Transportation Sci."},{"issue":"4","key":"10.1016\/0305-0548(83)90030-8_BIB527","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1287\/trsc.10.4.361","article-title":"Reduction and solution of large scale vehicle routing problems","volume":"10","author":"Orloff","year":"1976","journal-title":"Transportation Sci."},{"key":"10.1016\/0305-0548(83)90030-8_BIB528","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1007\/BFb0120888","article-title":"On the symmetric travelling salesman problem: a computational study","volume":"12","author":"Padberg","year":"1980","journal-title":"Mathematical Programming Study"},{"key":"10.1016\/0305-0548(83)90030-8_BIB529","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1002\/net.3230080306","article-title":"The complexity of the capacitated tree problem","volume":"8","author":"Papadimitriou","year":"1978","journal-title":"Networks"},{"key":"10.1016\/0305-0548(83)90030-8_BIB530","article-title":"On the complexity of the Chinese postman problem","author":"Papadimitriou","year":"1975"},{"issue":"3","key":"10.1016\/0305-0548(83)90030-8_BIB531","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1145\/321958.321974","article-title":"On the complexity of edge traversing","volume":"23","author":"Papadimitriou","year":"1976","journal-title":"J. ACM"},{"issue":"3","key":"10.1016\/0305-0548(83)90030-8_BIB532","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(77)90012-3","article-title":"The Euclidean traveling salesman problem is NP-complete","volume":"4","author":"Papadimitriou","year":"1977","journal-title":"Theor. Comp. Sci."},{"issue":"3","key":"10.1016\/0305-0548(83)90030-8_BIB533","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1007\/BF01588973","article-title":"The adjacency relation on the traveling salesman polytope is NP-complete","volume":"14","author":"Papadimitriou","year":"1978","journal-title":"Math. Prog."},{"issue":"1","key":"10.1016\/0305-0548(83)90030-8_BIB534","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1137\/0206005","article-title":"The complexity of local search for the traveling salesman problem","volume":"6","author":"Papadimitriou","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0305-0548(83)90030-8_BIB535","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1287\/opre.26.3.434","article-title":"Some examples of difficult traveling salesman problems","volume":"26","author":"Papadimitriou","year":"1978","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB536","series-title":"Combinatorial Optimization","author":"Papadimitriou","year":"1982"},{"issue":"2","key":"10.1016\/0305-0548(83)90030-8_BIB537","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1145\/322307.322309","article-title":"The complexity of restricted spanning tree problems","volume":"29","author":"Papadimitriou","year":"1982","journal-title":"J. Assoc. Comp. Mach."},{"key":"10.1016\/0305-0548(83)90030-8_BIB538","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1007\/BF01585517","article-title":"Implementation and efficiency of Moore-algorithms for the shortest route problem","volume":"1","author":"Pape","year":"1974","journal-title":"Math. Prog."},{"key":"10.1016\/0305-0548(83)90030-8_BIB539","series-title":"Computer Scheduling of Public Transport: Urban Passenger Vehicle and Crew Scheduling","first-page":"193","article-title":"Two approaches to computer crew scheduling","author":"Parker","year":"1981"},{"issue":"2","key":"10.1016\/0305-0548(83)90030-8_BIB540","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1080\/05695557708975137","article-title":"On the use of a vehicle routing algorithm for the parallel processor problem with sequence dependent change over costs","volume":"9","author":"Parker","year":"1977","journal-title":"AIIE Trans."},{"key":"10.1016\/0305-0548(83)90030-8_BIB541","series-title":"The traveling salesman problem: An update of research","author":"Parker","year":"1981"},{"issue":"1","key":"10.1016\/0305-0548(83)90030-8_BIB542","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1287\/opre.26.1.86","article-title":"The time-dependent traveling salesman problem and its application to the tardiness problem in one-machine scheduling","volume":"26","author":"Picard","year":"1978","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB543","series-title":"Computer Scheduling of Public Transport: Urban Passenger Vehicle and Crew Scheduling","first-page":"223","article-title":"Practical aspects in automatic crew scheduling","author":"Piccione","year":"1981"},{"key":"10.1016\/0305-0548(83)90030-8_BIB544","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1287\/mnsc.15.3.191","article-title":"Application of combinatorial programming algorithms for a class of all zero-one integer programming problems","volume":"15","author":"Pierce","year":"1968","journal-title":"Management Sci."},{"key":"10.1016\/0305-0548(83)90030-8_BIB545","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0041-1647(69)90101-4","article-title":"Direct search algorithms for truck-dispatching problems","volume":"3","author":"Pierce","year":"1969","journal-title":"Transportation Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB546","article-title":"An 0 (N log N) planar traveling salesman heuristic based on spacefilling curves","author":"Platzman","year":"1982","journal-title":"Georgia Institute of Technology PDRC Report Series 82-07"},{"key":"10.1016\/0305-0548(83)90030-8_BIB547","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/0041-1647(77)90040-5","article-title":"Some elements of the airline fleet planning problem","volume":"11","author":"Pollack","year":"1977","journal-title":"Transport Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB548","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1145\/359423.359430","article-title":"Convex hulls of finite sets of points in two and three dimensions","volume":"20","author":"Preparata","year":"1977","journal-title":"Commun. ACM"},{"key":"10.1016\/0305-0548(83)90030-8_BIB549","article-title":"Dynamic programming algorithms for specially structured sequencing and routing problems in transportation","author":"Psaraftis","year":"1978"},{"key":"10.1016\/0305-0548(83)90030-8_BIB550","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1287\/trsc.14.2.130","article-title":"A dynamic programming solution to the single vehicle many-to-many immediate request dial-a-ride problem","volume":"2","author":"Psaraftis","year":"1980","journal-title":"Transportation Sci."},{"key":"10.1016\/0305-0548(83)90030-8_BIB551","article-title":"K-Interchange procedures for local search in a precedence-constrained routing problem","author":"Psaraftis","year":"1981"},{"key":"10.1016\/0305-0548(83)90030-8_BIB552","doi-asserted-by":"crossref","unstructured":"H. Psaraftis, Analysis of an O(N2) Heuristic for the single vehicle many-to-many Euclidean dial-a-ride problem. Transportation Res. (to appear).","DOI":"10.1016\/0191-2615(83)90041-3"},{"key":"10.1016\/0305-0548(83)90030-8_BIB553","article-title":"A dynamic programming approach to the dial-a-ride problem: an extension to the multi-vehicle case","author":"Psaraftis","year":"1979"},{"key":"10.1016\/0305-0548(83)90030-8_BIB554","article-title":"Delivery planning by molar algorithms","author":"Raft","year":"1981"},{"key":"10.1016\/0305-0548(83)90030-8_BIB555","series-title":"Traveling purchaser problem","author":"Ramesh","year":"1978"},{"issue":"3","key":"10.1016\/0305-0548(83)90030-8_BIB556","doi-asserted-by":"crossref","first-page":"628","DOI":"10.1287\/opre.28.3.628","article-title":"A note on the multiple traveling salesman problem","volume":"28","author":"Rao","year":"1980","journal-title":"Ops Res."},{"issue":"4","key":"10.1016\/0305-0548(83)90030-8_BIB557","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1147\/rd.134.0400","article-title":"Heuristic algorithm for the traveling salesman problem","volume":"13","author":"Raymond","year":"1969","journal-title":"IBM J. Res. Dev."},{"key":"10.1016\/0305-0548(83)90030-8_BIB558","doi-asserted-by":"crossref","first-page":"692","DOI":"10.1287\/mnsc.16.11.692","article-title":"An analysis of private and public sector location models","volume":"16","author":"Revelle","year":"1970","journal-title":"Management Sci. Theory"},{"key":"10.1016\/0305-0548(83)90030-8_BIB559","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1111\/j.1538-4632.1970.tb00142.x","article-title":"Central facilities location","volume":"2","author":"Revelle","year":"1970","journal-title":"Geographical Anal."},{"key":"10.1016\/0305-0548(83)90030-8_BIB560","series-title":"Proc. Tenth AGIFORS Symp.","article-title":"Experience with the aircraft rotation model","author":"Richter","year":"1970"},{"key":"10.1016\/0305-0548(83)90030-8_BIB561","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1287\/trsc.10.1.52","article-title":"An optimization approach to routing aircraft","volume":"10","author":"Richardson","year":"1976","journal-title":"Transportation Sci."},{"key":"10.1016\/0305-0548(83)90030-8_BIB562","article-title":"Construction des parcours des vehicules et des horaires des chauffeurs pour le transport des personnes handicap\u00e9es","author":"Rivard","year":"1981","journal-title":"University of Montreal Transportation Research Center Publication No. 240"},{"key":"10.1016\/0305-0548(83)90030-8_BIB563","series-title":"Preprints, Workshop on Automated Techniques for Scheduling of Vehicle Operators for Urban Public Transportation Sciences","article-title":"Scheduling of postal truck drivers","author":"Roark","year":"1975"},{"key":"10.1016\/0305-0548(83)90030-8_BIB564","article-title":"A program for solution of large scale vehicle routing problems","author":"Robbins","year":"1976"},{"issue":"3","key":"10.1016\/0305-0548(83)90030-8_BIB565","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1287\/mnsc.13.3.269","article-title":"An engineering approach to the traveling salesman problem","volume":"13","author":"Roberts","year":"1966","journal-title":"Management Sci."},{"key":"10.1016\/0305-0548(83)90030-8_BIB566","article-title":"Operating cost models for urban public transportation and their use in analysis","author":"Roess","year":"1974","journal-title":"Transportation Res. Board"},{"key":"10.1016\/0305-0548(83)90030-8_BIB567","article-title":"Predicting operating and maintenance costs for rail rapid transit","author":"Roess","year":"1975"},{"key":"10.1016\/0305-0548(83)90030-8_BIB568","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1137\/0206041","article-title":"An analysis of several heuristics for the traveling salesman problem","volume":"6","author":"Rosenkrantz","year":"1977","journal-title":"SIAM J. Comp."},{"key":"10.1016\/0305-0548(83)90030-8_BIB569","series-title":"presented at National ORSA\/TIMS Meeting","article-title":"A school bus scheduling system","author":"Rousseau","year":"1980"},{"key":"10.1016\/0305-0548(83)90030-8_BIB570","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1287\/trsc.7.1.34","article-title":"A technique for the solution of massive set covering problems with application to airline crew scheduling","volume":"7","author":"Rubin","year":"1973","journal-title":"Transportation Sci."},{"key":"10.1016\/0305-0548(83)90030-8_BIB571","series-title":"Presented at the ORSA\/TIMS Meeting San Juan","article-title":"Efficient truck routing for industrial refuse collection","author":"Russell","year":"1974"},{"issue":"3","key":"10.1016\/0305-0548(83)90030-8_BIB572","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1287\/opre.25.3.517","article-title":"An effective heuristic for the M-tour traveling salesman problem with some side conditions","volume":"25","author":"Russell","year":"1977","journal-title":"Operations Res."},{"issue":"1","key":"10.1016\/0305-0548(83)90030-8_BIB573","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/net.3230090102","article-title":"An assignment routing problem","volume":"9","author":"Russell","year":"1979","journal-title":"Networks"},{"key":"10.1016\/0305-0548(83)90030-8_BIB574","series-title":"Computer Scheduling of Public Transport: Urban Passenger Vehicle and Crew Scheduling","first-page":"269","article-title":"An integer programming approach to scheduling","author":"Ryan","year":"1981"},{"key":"10.1016\/0305-0548(83)90030-8_BIB575","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1057\/jors.1970.95","article-title":"An algorithm for bus scheduling problems","volume":"21","author":"Saha","year":"1970","journal-title":"Op. Res. Quart."},{"issue":"6","key":"10.1016\/0305-0548(83)90030-8_BIB576","doi-asserted-by":"crossref","first-page":"920","DOI":"10.1287\/opre.25.6.920","article-title":"General techniques for combinatorial approximation","volume":"25","author":"Sahni","year":"1977","journal-title":"Op. Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB577","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1002\/nav.3800220110","article-title":"The knapsack problem: a survey","volume":"22","author":"Salkin","year":"1975","journal-title":"Naval Res. Logistics Quart."},{"issue":"4","key":"10.1016\/0305-0548(83)90030-8_BIB578","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1287\/trsc.3.4.297","article-title":"Timetables for a suburban rail transit system","volume":"3","author":"Salzborn","year":"1969","journal-title":"Transportation Sci."},{"key":"10.1016\/0305-0548(83)90030-8_BIB579","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1287\/trsc.4.4.383","article-title":"The minimum fleet size for a suburban railways system","volume":"4","author":"Salzborn","year":"1970","journal-title":"Transportation Sci."},{"key":"10.1016\/0305-0548(83)90030-8_BIB580","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1287\/trsc.6.3.335","article-title":"A note on fleet routing models for transportation systems","volume":"6","author":"Salzborn","year":"1972","journal-title":"Transportation Science"},{"key":"10.1016\/0305-0548(83)90030-8_BIB581","series-title":"Transportation and Traffic Theory","first-page":"607","article-title":"Minimum fleet size models for transportation systems","author":"Salzborn","year":"1974"},{"key":"10.1016\/0305-0548(83)90030-8_BIB582","series-title":"Computer Scheduling of Public Transport: Urban Passenger Vehicle and Crew Scheduling","first-page":"17","article-title":"The status of computer-aided scheduling in North America","author":"Schmidt","year":"1981"},{"key":"10.1016\/0305-0548(83)90030-8_BIB583","series-title":"Computer Scheduling of Public Transport: Urban Passenger Vehicle and Crew Scheduling","first-page":"345","article-title":"Automating extraboard assignments and coach operator timekeeping","author":"Schmidt","year":"1981"},{"key":"10.1016\/0305-0548(83)90030-8_BIB584","series-title":"The feasibility study of the employment center bus service concept","author":"Schnitt","year":"1976"},{"issue":"2","key":"10.1016\/0305-0548(83)90030-8_BIB585","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1002\/net.3230110212","article-title":"Formulation and structure of more complex\/realistic routing and scheduling problems","volume":"11","author":"Schrage","year":"1981","journal-title":"Networks"},{"issue":"3","key":"10.1016\/0305-0548(83)90030-8_BIB586","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1287\/inte.9.3.13","article-title":"A practical method for vehicle scheduling","volume":"9","author":"Schultz","year":"1979","journal-title":"Interfaces"},{"key":"10.1016\/0305-0548(83)90030-8_BIB587","article-title":"Heuristic routing for solid waste collection vehicles","author":"Schuster","year":"1974"},{"key":"10.1016\/0305-0548(83)90030-8_BIB588","series-title":"Combinational Programming, Spatial Analysis and Planning","author":"Scott","year":"1971"},{"key":"10.1016\/0305-0548(83)90030-8_BIB589","doi-asserted-by":"crossref","first-page":"808","DOI":"10.1287\/opre.22.4.808","article-title":"The operator-sceduling problem: a network-flow approach","volume":"22","author":"Segal","year":"1974","journal-title":"Op. Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB590","article-title":"The single vehicle many to many routing and scheduling problem","author":"Sexton","year":"1979"},{"key":"10.1016\/0305-0548(83)90030-8_BIB591","article-title":"The single vehicle many to many routing and scheduling problem with desired delivery times","author":"Sexton","year":"1980"},{"key":"10.1016\/0305-0548(83)90030-8_BIB592","article-title":"The single vehicle many-to-many routing and scheduling problem with customer-dependent dwell times","author":"Sexton","year":"1981"},{"key":"10.1016\/0305-0548(83)90030-8_BIB593","article-title":"Algorithms for the solution of the optimal cost travelling salesman problem","author":"Shapiro","year":"1966"},{"key":"10.1016\/0305-0548(83)90030-8_BIB594","series-title":"Annals of Discrete Mathematics\u2014No., 5 Discrete Optimization","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/S0167-5060(08)70346-7","article-title":"A survey of Lagrangian techniques for discrete optimization","author":"Shapiro","year":"1979"},{"key":"10.1016\/0305-0548(83)90030-8_BIB595","series-title":"Preprints, Workshop on Automated Techniques for Scheduling of Vehicle Operators for Urban Public Transportation Services","article-title":"Constants for Scheduling Operators for Urban Public Transit Systems","author":"Sharp","year":"1975"},{"key":"10.1016\/0305-0548(83)90030-8_BIB596","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1287\/mnsc.26.3.274","article-title":"A Lagrangian relaxation algorithm for the two duty period scheduling problem","volume":"26","author":"Shepardson","year":"1980","journal-title":"Management Sci."},{"issue":"3","key":"10.1016\/0305-0548(83)90030-8_BIB597","first-page":"205","volume":"6","author":"Shier","year":"1976","journal-title":"Iterative methods for determining the k shortest paths in a network"},{"issue":"3","key":"10.1016\/0305-0548(83)90030-8_BIB598","first-page":"195","volume":"9","author":"Shier","year":"1979","journal-title":"On Algorithms for finding the K shortest paths in a network"},{"key":"10.1016\/0305-0548(83)90030-8_BIB599","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0377-2217(80)90084-3","article-title":"A tutorial on heuristic methods","volume":"5","author":"Silver","year":"1980","journal-title":"European J. Op. Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB600","article-title":"Computerized schedule construction for an airline transportation system","author":"Simpson","year":"1966"},{"key":"10.1016\/0305-0548(83)90030-8_BIB601","article-title":"Scheduling and routing models for airline systems","author":"Simpson","year":"1969"},{"key":"10.1016\/0305-0548(83)90030-8_BIB602","series-title":"Proc. Ninth AGIFORS Symp. Operations Research Division, American Airlines","article-title":"A review of scheduling and routing models for airline scheduling","author":"Simpson","year":"1969"},{"key":"10.1016\/0305-0548(83)90030-8_BIB603","article-title":"A method for determination of optimum vehicle size and frequency of service for a short Haul V\/STOL air transport system","author":"Simpson","year":"1968"},{"key":"10.1016\/0305-0548(83)90030-8_BIB604","article-title":"Some new computational experiments with the TSP","author":"Skiscim","year":"1982"},{"key":"10.1016\/0305-0548(83)90030-8_BIB605","series-title":"Computer Scheduling of Public Transport: Urban Passenger Vehicle and Crew Scheduling","first-page":"97","article-title":"VAMPIRES and TASC: two successfully applied bus scheduling programs","author":"Smith","year":"1981"},{"key":"10.1016\/0305-0548(83)90030-8_BIB606","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1007\/BFb0120889","article-title":"A LIFO implicit enumeration algorithm for the asymmetric traveling salesman problem using a onearborscence relaxation","volume":"12","author":"Smith","year":"1980","journal-title":"Mathematical Programming Study"},{"key":"10.1016\/0305-0548(83)90030-8_BIB607","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1016\/S0167-5060(08)70755-6","article-title":"Computational performance of three subtour elimination algorithms for solving asymmetric traveling salesman problems","volume":"1","author":"Smith","year":"1977","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0305-0548(83)90030-8_BIB608","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1016\/S0167-5060(08)70754-4","article-title":"A LIFO implicit enumeration search algorithm for the symmetric traveling salesman problem using Held and Karp's 1-tree relaxation","volume":"1","author":"Smith","year":"1977","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0305-0548(83)90030-8_BIB609","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0191-2615(80)90044-2","article-title":"A model for large scale aircraft routing and scheduling problems","volume":"14B","author":"Soumis","year":"1980","journal-title":"Transportation Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB610","series-title":"AGIFORS Symp.","article-title":"Solution to the crew scheduling problem","author":"Spitzer","year":"1961"},{"key":"10.1016\/0305-0548(83)90030-8_BIB611","first-page":"84","article-title":"The computer art of schedule-making","author":"Spitzer","year":"1969","journal-title":"Datamation"},{"key":"10.1016\/0305-0548(83)90030-8_BIB612","article-title":"An improved algorithm for computing degree-constrained minimal spanning trees","author":"Srikanth","year":"1980"},{"key":"10.1016\/0305-0548(83)90030-8_BIB613","series-title":"Proc. of the 6th Ann. Allerton Conf. on Circuit and Systems Theory","first-page":"814","article-title":"Some improved algorithms for computer solution to the traveling salesman problem","author":"Steiglitz","year":"1968"},{"key":"10.1016\/0305-0548(83)90030-8_BIB614","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1109\/TCT.1969.1083004","article-title":"The design of minimum cost survivable networks","volume":"CT-16","author":"Steiglitz","year":"1969","journal-title":"IEEE Trans. Circ. Theory"},{"key":"10.1016\/0305-0548(83)90030-8_BIB615","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1287\/trsc.12.3.232","article-title":"Scheduling dial-a-ride transportation systems","volume":"12","author":"Stein","year":"1978","journal-title":"Transportation Sci."},{"key":"10.1016\/0305-0548(83)90030-8_BIB616","article-title":"Scheduling dial-a-ride transportation system","author":"Stein","year":"1977"},{"key":"10.1016\/0305-0548(83)90030-8_BIB617","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1287\/moor.3.2.89","article-title":"An asymptotic probabilistic analysis of a routing problem","volume":"3","author":"Stein","year":"1978","journal-title":"Math. Ops Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB618","article-title":"Optimal service policies for solid waste treatment facilities","author":"Stern","year":"1969"},{"key":"10.1016\/0305-0548(83)90030-8_BIB619","first-page":"154","article-title":"Bus and crew scheduling (note)","volume":"14A","author":"Stern","year":"1980","journal-title":"Transportation Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB620","series-title":"Computer Scheduling of Public Transport: Urban Passenger Vehicle and Crew Scheduling","first-page":"97","article-title":"A deficit function approach for bus scheduling","author":"Stern","year":"1981"},{"key":"10.1016\/0305-0548(83)90030-8_BIB621","series-title":"CORS\/ORSA\/TIMSMeeting","article-title":"Heuristic reductions for bus fleet scheduling with large M numbers of terminals","author":"Stern","year":"1981"},{"key":"10.1016\/0305-0548(83)90030-8_BIB622","series-title":"Proc. 8th Int. Symp. Transportation and Traffic Theory, University of Toronto","article-title":"The garage constrained-balance vehicle schedule minimum fleet size problem","author":"Stern","year":"1981"},{"key":"10.1016\/0305-0548(83)90030-8_BIB623","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0305-0548(79)90005-4","article-title":"Routing electric meter readers","volume":"6","author":"Stern","year":"1979","journal-title":"Comput. Ops Res."},{"issue":"3","key":"10.1016\/0305-0548(83)90030-8_BIB624","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1287\/trsc.14.3.277","article-title":"Scheduling aircraft cleaning crews","volume":"14","author":"Stern","year":"1980","journal-title":"Transportation Sci."},{"key":"10.1016\/0305-0548(83)90030-8_BIB625","series-title":"Paper presented at the ORSA\/TIMS Joint National Meeting","article-title":"The delivery truck routing problem with stochastic demands","author":"Stewart","year":"1976"},{"key":"10.1016\/0305-0548(83)90030-8_BIB626","series-title":"Proc. Thirteenth Ann. Meeting of Southeastern TIMS","first-page":"75","article-title":"A computationally efficient heuristic for the traveling salesman problem","author":"Stewart","year":"1977"},{"key":"10.1016\/0305-0548(83)90030-8_BIB627","article-title":"New algorithms for deterministic and stochastic vehicle routing problems","author":"Stewart","year":"1981"},{"key":"10.1016\/0305-0548(83)90030-8_BIB628","first-page":"108","article-title":"A vehicle routing algorithm based on generalized Lagrange multipliers","volume":"Vol. 2","author":"Stewart","year":"1979"},{"key":"10.1016\/0305-0548(83)90030-8_BIB629","article-title":"A Lagrangean Relaxation Heuristic for Vehicle Routing","author":"Stewart","year":"1982"},{"key":"10.1016\/0305-0548(83)90030-8_BIB630","article-title":"Stochastic vehicle routing: a comprehensive approach","author":"Stewart","year":"1982"},{"key":"10.1016\/0305-0548(83)90030-8_BIB631","series-title":"Proc. N.E. AIDS","first-page":"33","article-title":"A chance-constrained approach to the stochastic vehicle routing problem","author":"Stewart","year":"1980"},{"key":"10.1016\/0305-0548(83)90030-8_BIB632","series-title":"Proc. IEEE Int. Conf. on Circuits and Computers","first-page":"153","article-title":"The subscriber bus routing problem","author":"Stewart","year":"1980"},{"key":"10.1016\/0305-0548(83)90030-8_BIB633","series-title":"Proc. of 1980 SE TIMS Conference","first-page":"170","article-title":"Computing effective subscriber bus routes","author":"Stewart","year":"1981"},{"key":"10.1016\/0305-0548(83)90030-8_BIB634","series-title":"Presented at the New York ORSA\/TIMS meeting","article-title":"A heuristic algorithm for obtaining an initial solution for the traveling salesman problem","author":"Stinson","year":"1978"},{"key":"10.1016\/0305-0548(83)90030-8_BIB635","article-title":"Public sector vehicle routing: the Chinese postman problem","author":"Stricker","year":"1970"},{"key":"10.1016\/0305-0548(83)90030-8_BIB636","series-title":"Presented at 39th Operations Research meeting in Dallas","article-title":"Public sector routing models","author":"Stricker","year":"1971"},{"issue":"2","key":"10.1016\/0305-0548(83)90030-8_BIB637","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/BF01609019","article-title":"A continuous variable representation of the traveling salesman problem","volume":"15","author":"Svestka","year":"1978","journal-title":"Math. Prog."},{"issue":"7","key":"10.1016\/0305-0548(83)90030-8_BIB638","doi-asserted-by":"crossref","first-page":"790","DOI":"10.1287\/mnsc.19.7.790","article-title":"Computational experience with and M-salesmen traveling salesman algorithm","volume":"19","author":"Svestka","year":"1973","journal-title":"Management Sci."},{"key":"10.1016\/0305-0548(83)90030-8_BIB639","article-title":"Scheduling school buses","author":"Swersey","year":"1982"},{"key":"10.1016\/0305-0548(83)90030-8_BIB640","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/BF01584676","article-title":"A new solvable case of the traveling salesman problem","volume":"4","author":"Syslo","year":"1973","journal-title":"Math. Prog."},{"key":"10.1016\/0305-0548(83)90030-8_BIB641","first-page":"343","article-title":"Optimal train scheduling on a single track railway","author":"Szpigel","year":"1972","journal-title":"Ops. Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB642","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1137\/1020067","article-title":"Complexity of combinatorial algorithms","volume":"20","author":"Tarjan","year":"1978","journal-title":"SIAM Rev."},{"key":"10.1016\/0305-0548(83)90030-8_BIB643","article-title":"An exact algorithm for the exponential disutility dial-a-ride problem","author":"Tharakan","year":"1981","journal-title":"Transportation Sci."},{"key":"10.1016\/0305-0548(83)90030-8_BIB644","article-title":"Airline crew scheduling: a group theoretic approach","author":"Thiriez","year":"1969"},{"key":"10.1016\/0305-0548(83)90030-8_BIB645","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1287\/mnsc.19.1.71","article-title":"Optimal scheduling of two consecutive idle periods","volume":"10","author":"Tibrewala","year":"1972","journal-title":"Management Sci."},{"key":"10.1016\/0305-0548(83)90030-8_BIB646","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1287\/trsc.3.3.192","article-title":"The multiple terminal delivery problem with probabilistic demands","volume":"3","author":"Tillman","year":"1969","journal-title":"Transportation Sci."},{"issue":"2","key":"10.1016\/0305-0548(83)90030-8_BIB647","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1287\/trsc.4.2.232","article-title":"The author's reply to Uebe's","volume":"4","author":"Tillman","year":"1970","journal-title":"Transportation Sci."},{"key":"10.1016\/0305-0548(83)90030-8_BIB648","doi-asserted-by":"crossref","first-page":"664","DOI":"10.1287\/mnsc.18.11.664","article-title":"An upper bounding algorithm for the single and multiple terminal delivery problem","volume":"18","author":"Tillman","year":"1972","journal-title":"Management Sci."},{"key":"10.1016\/0305-0548(83)90030-8_BIB649","first-page":"354","article-title":"A heuristic approach for solving the delivery problem","volume":"19","author":"Tillman","year":"1968","journal-title":"J. Ind. Engng"},{"key":"10.1016\/0305-0548(83)90030-8_BIB650","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0041-1647(71)90023-2","article-title":"A study of a look-ahead procedure for solving the multiterminal delivery problem","volume":"5","author":"Tillman","year":"1971","journal-title":"Transortation Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB651","doi-asserted-by":"crossref","first-page":"1363","DOI":"10.1287\/opre.19.6.1363","article-title":"The location of emergency service facilities","volume":"19","author":"Toregas","year":"1971","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB652","series-title":"Paper presented at the 36th National Meeting of the Operations Research Society of America","article-title":"Computerized route planning for school buses: design and implementation","author":"Tracz","year":"1969"},{"key":"10.1016\/0305-0548(83)90030-8_BIB653","article-title":"A computerized system for school bus routing","author":"Tracz","year":"1970"},{"key":"10.1016\/0305-0548(83)90030-8_BIB654","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1080\/05695557408974967","article-title":"Transportation routing problem\u2014a survey","volume":"6","author":"Turner","year":"1974","journal-title":"AIIE Trans."},{"key":"10.1016\/0305-0548(83)90030-8_BIB655","first-page":"76","article-title":"A practical method for the truck dispatching problem","volume":"10","author":"Tyagi","year":"1968","journal-title":"J. Ops Res. Soc. Japan"},{"issue":"2","key":"10.1016\/0305-0548(83)90030-8_BIB656","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1287\/trsc.4.2.226","article-title":"Comments on Tillman's paper","volume":"4","author":"Uebe","year":"1970","journal-title":"Transportation Sci."},{"issue":"2","key":"10.1016\/0305-0548(83)90030-8_BIB657","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1057\/jors.1968.55","article-title":"Bases for vehicle fleet scheduling","volume":"19","author":"Unwin","year":"1968","journal-title":"Op. Res. Quart."},{"key":"10.1016\/0305-0548(83)90030-8_BIB658","author":"Urban Mass Transportation Administration","year":"1975"},{"key":"10.1016\/0305-0548(83)90030-8_BIB659","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1057\/jors.1978.147","article-title":"Heuristic for the asymmetric travelling salesman problem","volume":"30","author":"Van der Cruyssen","year":"1978","journal-title":"J. Op. Res. Soc."},{"key":"10.1016\/0305-0548(83)90030-8_BIB660","series-title":"A Transportation scheduling model","author":"Vandersypen","year":"1971"},{"key":"10.1016\/0305-0548(83)90030-8_BIB661","doi-asserted-by":"crossref","DOI":"10.1016\/0305-0548(74)90049-5","article-title":"Automated pupil transportation","volume":"1","author":"Verderber","year":"1974","journal-title":"Comput. Ops Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB662","article-title":"Alternative techniques for modeling travel distances","author":"Voccaro","year":"1979"},{"key":"10.1016\/0305-0548(83)90030-8_BIB663","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1287\/trsc.2.4.303","article-title":"Rapid transit interstation spacings for minimum travel time","volume":"2","author":"Vuchic","year":"1968","journal-title":"Transportation Sci."},{"key":"10.1016\/0305-0548(83)90030-8_BIB664","series-title":"Rand Fire Project: Fire Department Deployment Analysis","author":"Walker","year":"1979"},{"key":"10.1016\/0305-0548(83)90030-8_BIB665","series-title":"Computer Scheduling of Public Transport: Urban Passenger Vehicle and Crew Scheduling","first-page":"297","article-title":"A Problem Decomposition Approach to Scheduling the Drivers and Crews of Mass Transit Systems","author":"Ward","year":"1981"},{"key":"10.1016\/0305-0548(83)90030-8_BIB666","unstructured":"C. Watson-Gandy and L. Foulds, The vehicle scheduling problem: a survey: unpublished manuscript."},{"issue":"1","key":"10.1016\/0305-0548(83)90030-8_BIB667","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1057\/jors.1971.19","article-title":"Some methods of producing approximate solutions to traveling salesman problems with hundreds or thousands of cities","volume":"22","author":"Webb","year":"1971","journal-title":"Op. Res. Quart."},{"issue":"3","key":"10.1016\/0305-0548(83)90030-8_BIB668","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1057\/jors.1972.55","article-title":"Relative performance of some sequential methods of planning multiple delivery journeys","volume":"23","author":"Webb","year":"1972","journal-title":"Op. Res. Quart."},{"issue":"2","key":"10.1016\/0305-0548(83)90030-8_BIB669","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1057\/jors.1973.49","article-title":"The savings method for vehicle scheduling\u2014a reply","volume":"24","author":"Webb","year":"1973","journal-title":"Op. Res. Quart."},{"key":"10.1016\/0305-0548(83)90030-8_BIB670","series-title":"5th SIGACT Proc.","first-page":"207","article-title":"Neighborhood search algorithms for finding optimal traveling salesman tours must be inefficient","author":"Weiner","year":"1973"},{"key":"10.1016\/0305-0548(83)90030-8_BIB671","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0305-0548(80)90004-0","article-title":"Using multidimensional scaling to solve traveling salesman and machine scheduling problems","volume":"7","author":"White","year":"1980","journal-title":"Comput. Ops Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB672","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1147\/sj.82.0147","article-title":"A network algorithm for empty freight car allocation","volume":"9","author":"White","year":"1969","journal-title":"IBM Systems J."},{"key":"10.1016\/0305-0548(83)90030-8_BIB673","series-title":"Preprints, Workshop on Automated Techniques for Scheduling of Vehicle Operators for Urban Public Transportation Services","article-title":"Overview of the RUCUS package driver run cutting program (RUNS)","author":"Wilhelm","year":"1975"},{"key":"10.1016\/0305-0548(83)90030-8_BIB674","first-page":"347","article-title":"Algorithm 232: Heapsort","volume":"7","author":"Williams","year":"1974","journal-title":"Commun. ACM"},{"key":"10.1016\/0305-0548(83)90030-8_BIB675","series-title":"Proc. Seventh AGIFORS Symp.","first-page":"11","article-title":"Computer programs for fleet and schedule planning","author":"Williamson","year":"1967"},{"key":"10.1016\/0305-0548(83)90030-8_BIB676","article-title":"CARS\u2014computer aided routing system","author":"Wilson","year":"1967"},{"key":"10.1016\/0305-0548(83)90030-8_BIB677","article-title":"Dynamic routing: a study of assignment algorithms","author":"Wilson","year":"1969"},{"key":"10.1016\/0305-0548(83)90030-8_BIB678","series-title":"Preprints, Workshop on Automated Techniques for Scheduling of Vehicle Operators for Urban Public Transportation Services","article-title":"The effect of driver schedules on dial-a-ride performance","author":"Wilson","year":"1975"},{"key":"10.1016\/0305-0548(83)90030-8_BIB679","article-title":"Computer control of the Rochester dial-a-ride system","author":"Wilson","year":"1977"},{"key":"10.1016\/0305-0548(83)90030-8_BIB680","article-title":"Advanced dial-a-ride algorithms research project, Phase II. Interim report","author":"Wilson","year":"1977"},{"key":"10.1016\/0305-0548(83)90030-8_BIB681","series-title":"39th National Meeting of ORSA","article-title":"Implementation of computer algorithms for the dial-a-bus system","author":"Wilson","year":"1971"},{"key":"10.1016\/0305-0548(83)90030-8_BIB682","article-title":"Scheduling algorithms for a dial-a-ride system","author":"Wilson","year":"1971"},{"key":"10.1016\/0305-0548(83)90030-8_BIB683","article-title":"Advanced dial-a-ride algorithms research project final report","author":"Wilson","year":"1976"},{"key":"10.1016\/0305-0548(83)90030-8_BIB684","article-title":"Advanced dial-a-ride algorithms. Intern report","author":"Wilson","year":"1975"},{"key":"10.1016\/0305-0548(83)90030-8_BIB685","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0041-1647(75)90055-6","article-title":"A rapid heuristic algorithm for the approximate solution of the traveling salesman problem","volume":"9","author":"Wiorkowski","year":"1975","journal-title":"Transportation Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB686","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1287\/trsc.11.4.359","article-title":"Optimal parameters for a coordinated rail and bus transit system","volume":"11","author":"Wirasinghe","year":"1977","journal-title":"Transportation Sci."},{"issue":"5","key":"10.1016\/0305-0548(83)90030-8_BIB687","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1016\/0377-2217(79)90119-X","article-title":"Minimizing the number of aircraft for a transportation network","volume":"3","author":"Wolters","year":"1979","journal-title":"European J. Op. Res."},{"key":"10.1016\/0305-0548(83)90030-8_BIB688","article-title":"Computer aided scheduling for wheel-tram service","author":"Wong","year":"1978"},{"key":"10.1016\/0305-0548(83)90030-8_BIB689","series-title":"Computer scheduling for door-to-door transit service-computer program specification","author":"Wong","year":"1979"},{"key":"10.1016\/0305-0548(83)90030-8_BIB690","series-title":"Proc. of IEEE International Conference on Circuits and Computers","first-page":"149","article-title":"Interger programming formulations of the traveling salesman problem","author":"Wong","year":"1980"},{"key":"10.1016\/0305-0548(83)90030-8_BIB691","series-title":"Preprints, Workshop on Automated Techniques for Scheduling of Vehicle Operators for Urban Public Transportation Services","article-title":"Techniques for vehicle operator scheduling at the Chicago Transit Authority (CTA)","author":"Worcester","year":"1975"},{"key":"10.1016\/0305-0548(83)90030-8_BIB692","article-title":"Computer Scheduling of Public Transport: Urban Passenger Vehicle and Crew Scheduling","year":"1981"},{"key":"10.1016\/0305-0548(83)90030-8_BIB693","series-title":"Computer Scheduling of Public Transport: Urban Passenger Vehicle and Crew Scheduling","first-page":"3","article-title":"General review of the use of computers in scheduling buses and their crews","author":"Wren","year":"1981"},{"key":"10.1016\/0305-0548(83)90030-8_BIB694","article-title":"Applications of computers to transport scheduling in the United Kingdom","author":"Wren","year":"1969"},{"key":"10.1016\/0305-0548(83)90030-8_BIB695","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1057\/jors.1972.53","article-title":"Computer scheduling of vehicles from one or more depots to a number of delivery points","volume":"23","author":"Wren","year":"1972","journal-title":"Op. Res. Quart."},{"key":"10.1016\/0305-0548(83)90030-8_BIB696","unstructured":"C. E. Yang, How good is the largest angle method. Submitted for publication."},{"key":"10.1016\/0305-0548(83)90030-8_BIB697","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1002\/nav.3800270114","article-title":"A note on determining operating strategies for probabilistic vehicle routing","volume":"27","author":"Yee","year":"1980","journal-title":"Naval Res. Logistics Quart."},{"key":"10.1016\/0305-0548(83)90030-8_BIB698","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1057\/jors.1970.52","article-title":"A computational modification to the savings method of vehicle scheduling","volume":"21","author":"Yellow","year":"1970","journal-title":"Op. Res. Quart."},{"key":"10.1016\/0305-0548(83)90030-8_BIB699","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1287\/trsc.4.3.243","article-title":"Scheduling a fixed schedule, common carrier passenger transportation system","volume":"4","author":"Young","year":"1970","journal-title":"Transportation Sci."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054883900308?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054883900308?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,6,8]],"date-time":"2021-06-08T11:06:42Z","timestamp":1623150402000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054883900308"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,1]]},"references-count":699,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1983,1]]}},"alternative-id":["0305054883900308"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(83)90030-8","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1983,1]]}}}