{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:29:19Z","timestamp":1759336159523},"reference-count":88,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1981,1,1]],"date-time":"1981-01-01T00:00:00Z","timestamp":347155200000},"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":[[1981,1]]},"DOI":"10.1016\/0305-0548(81)90035-6","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T16:15:45Z","timestamp":1056989745000},"page":"71-81","source":"Crossref","is-referenced-by-count":17,"title":["Current and future research directions in network optimization"],"prefix":"10.1016","volume":"8","author":[{"given":"B.","family":"Golden","sequence":"first","affiliation":[]},{"given":"M.","family":"Ball","sequence":"additional","affiliation":[]},{"given":"L.","family":"Bodin","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(81)90035-6_BIB1","article-title":"Implementing primal-dual network flow algorithms","author":"Aashtiani","year":"1977"},{"issue":"4","key":"10.1016\/0305-0548(81)90035-6_BIB2","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1002\/net.3230080405","article-title":"Primal simplex network codes: State-of-the-art implementation technology","volume":"8","author":"Ali","year":"1978","journal-title":"Networks"},{"issue":"1","key":"10.1016\/0305-0548(81)90035-6_BIB3","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1002\/net.3230080107","article-title":"Multicommodity network flows\u2014a survey","volume":"8","author":"Assad","year":"1978","journal-title":"Networks"},{"key":"10.1016\/0305-0548(81)90035-6_BIB4","unstructured":"E. Balas and N. Christofides, A Restricted Lagrangean Approach to the Traveling Salesman Problem, submitted for publication."},{"issue":"2","key":"10.1016\/0305-0548(81)90035-6_BIB5","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1002\/net.3230100206","article-title":"The complexity of network reliability computations","volume":"10","author":"Ball","year":"1980","journal-title":"Networks"},{"key":"10.1016\/0305-0548(81)90035-6_BIB6","doi-asserted-by":"crossref","first-page":"823","DOI":"10.1287\/opre.27.4.823","article-title":"Computing network reliability","volume":"27","author":"Ball","year":"1979","journal-title":"Ops. Res."},{"key":"10.1016\/0305-0548(81)90035-6_BIB7","unstructured":"M. Ball, L. Bodin and R. Dial, Scheduling drivers for mass transit systems using interactive optimization, submitted for publication."},{"issue":"1","key":"10.1016\/0305-0548(81)90035-6_BIB8","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":"Mathematical Programming"},{"key":"10.1016\/0305-0548(81)90035-6_BIB9","series-title":"Pres. ORSA\/TIMS Spring Meeting","article-title":"Recognition algorithms for network flow problem","author":"Bartholdi","year":"1979"},{"issue":"1","key":"10.1016\/0305-0548(81)90035-6_BIB10","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(81)90035-6_BIB11","series-title":"Pres. ORSA\/TIMS Spring Meeting","article-title":"Finding network structure in linear programs","author":"Bixby","year":"1979"},{"key":"10.1016\/0305-0548(81)90035-6_BIB12","unstructured":"L. Bodin and B. Golden, Vehicle routing and scheduling: A survey, forthcoming in Networks."},{"issue":"4","key":"10.1016\/0305-0548(81)90035-6_BIB13","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."},{"issue":"3","key":"10.1016\/0305-0548(81)90035-6_BIB14","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1080\/05695557508975006","article-title":"Survey of deterministic networks","volume":"7","author":"Bradley","year":"1975","journal-title":"AIIE Trans."},{"issue":"1","key":"10.1016\/0305-0548(81)90035-6_BIB15","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."},{"issue":"2","key":"10.1016\/0305-0548(81)90035-6_BIB16","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"},{"issue":"1","key":"10.1016\/0305-0548(81)90035-6_BIB17","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. Mathematical Software"},{"key":"10.1016\/0305-0548(81)90035-6_BIB18","unstructured":"N. Christofides, A. Mingozzi and P. Toth, Exact algorithms for the vehicle routing problem based on spanning tree and shortest path relaxations, submitted for publication."},{"key":"10.1016\/0305-0548(81)90035-6_BIB19","series-title":"Proc 4th. Int. Conf. on Operations Research","first-page":"81","article-title":"A heuristic approach to some sales territory problems","author":"Cloonan","year":"1966"},{"key":"10.1016\/0305-0548(81)90035-6_BIB20","series-title":"Proc. 3rd. Ann. ACM Symp. Theory of Computing","first-page":"151","article-title":"The complexity of theorem-proving procedures","author":"Cook","year":"1971"},{"key":"10.1016\/0305-0548(81)90035-6_BIB21","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(81)90035-6_BIB22","article-title":"Cash management in the multinational firm: A constrained generalized network approach","author":"Crum","year":"1976"},{"key":"10.1016\/0305-0548(81)90035-6_BIB23","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF01580379","article-title":"A network simplex method","volume":"11","author":"Cunningham","year":"1976","journal-title":"Mathematical Programming"},{"key":"10.1016\/0305-0548(81)90035-6_BIB24","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":"Mathematical Programming Study No. 8: Polyhedral Combinatorics"},{"key":"10.1016\/0305-0548(81)90035-6_BIB25","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."},{"issue":"1","key":"10.1016\/0305-0548(81)90035-6_BIB26","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(81)90035-6_BIB27","article-title":"A shortest augmenting path method for solving minimal perfect matching problems","author":"Derigs","year":"1979"},{"key":"10.1016\/0305-0548(81)90035-6_BIB28","article-title":"On two methods for solving minimal perfect matching problems","author":"Derigs","year":"1979"},{"issue":"3","key":"10.1016\/0305-0548(81)90035-6_BIB29","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"},{"issue":"1","key":"10.1016\/0305-0548(81)90035-6_BIB30","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1002\/net.1975.5.1.81","article-title":"Energy networks","volume":"5","author":"Dommel","year":"1975","journal-title":"Networks"},{"issue":"1","key":"10.1016\/0305-0548(81)90035-6_BIB31","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1287\/moor.4.1.39","article-title":"A strongly convergent primal simplex algorithm for generalized networks","volume":"4","author":"Elam","year":"1979","journal-title":"Math. Ops. Res."},{"issue":"4","key":"10.1016\/0305-0548(81)90035-6_BIB32","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1287\/opre.26.4.673","article-title":"A single commodity transformation for certain multicommodity networks","volume":"26","author":"Evans","year":"1978","journal-title":"Ops. Res."},{"key":"10.1016\/0305-0548(81)90035-6_BIB33","unstructured":"M. Fisher and R. Jaikutnar. A generalized assignment heuristic for vehicle routing, forthcoming in Networks."},{"issue":"4","key":"10.1016\/0305-0548(81)90035-6_BIB34","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1287\/trsc.10.4.374","article-title":"An application and validation of equilibrium trip assignment methods","volume":"10","author":"Florian","year":"1976","journal-title":"Transn Sci."},{"key":"10.1016\/0305-0548(81)90035-6_BIB35","series-title":"Facility Layout and Location: An Analytical Approach","author":"Francis","year":"1974"},{"issue":"1","key":"10.1016\/0305-0548(81)90035-6_BIB36","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1002\/net.1975.5.1.69","article-title":"Computer networks","volume":"5","author":"Frank","year":"1975","journal-title":"Networks"},{"key":"10.1016\/0305-0548(81)90035-6_BIB37","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"issue":"5","key":"10.1016\/0305-0548(81)90035-6_BIB38","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."},{"key":"10.1016\/0305-0548(81)90035-6_BIB39","series-title":"Integer Programming","author":"Garfinkel","year":"1972"},{"key":"10.1016\/0305-0548(81)90035-6_BIB40","article-title":"The traveling salesman problem and related problems","author":"Gavish","year":"1978"},{"issue":"4","key":"10.1016\/0305-0548(81)90035-6_BIB41","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(81)90035-6_BIB42","doi-asserted-by":"crossref","first-page":"822","DOI":"10.1287\/mnsc.20.5.822","article-title":"Multi-commodity distribution systems design by Benders' decomposition","volume":"20","author":"Geoffrion","year":"1974","journal-title":"Management Sci."},{"key":"10.1016\/0305-0548(81)90035-6_BIB43","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":"Giimore","year":"1964","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(81)90035-6_BIB44","doi-asserted-by":"crossref","DOI":"10.6028\/NBS.TN.772","article-title":"A performance comparison of labeling algorithms for calculating shortest path trees","author":"Gilsinn","year":"1973"},{"issue":"3","key":"10.1016\/0305-0548(81)90035-6_BIB45","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(81)90035-6_BIB46","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1080\/05695557708975168","article-title":"Network application in industry and government","volume":"9","author":"Glover","year":"1977","journal-title":"AIIE Trans."},{"issue":"6","key":"10.1016\/0305-0548(81)90035-6_BIB47","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."},{"issue":"1","key":"10.1016\/0305-0548(81)90035-6_BIB48","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":"1979","journal-title":"Naval Res. Logistics Q."},{"issue":"4","key":"10.1016\/0305-0548(81)90035-6_BIB49","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(81)90035-6_BIB50","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(81)90035-6_BIB51","series-title":"Proc. of 1979 Northeast AIDS Conference","first-page":"71","article-title":"Solving large distribution routing problems efficiently","author":"Golden","year":"1979"},{"issue":"1","key":"10.1016\/0305-0548(81)90035-6_BIB52","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0305-0548(79)90010-8","article-title":"Models and solution techniques for cash flow management","volume":"6","author":"Golden","year":"1979","journal-title":"Comput. and Ops Res."},{"issue":"2","key":"10.1016\/0305-0548(81)90035-6_BIB53","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"},{"issue":"3","key":"10.1016\/0305-0548(81)90035-6_BIB54","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":"Mathematical Programming"},{"issue":"3","key":"10.1016\/0305-0548(81)90035-6_BIB55","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":"Mathematical Programming"},{"issue":"6","key":"10.1016\/0305-0548(81)90035-6_BIB56","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."},{"issue":"1","key":"10.1016\/0305-0548(81)90035-6_BIB57","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1007\/BF01584070","article-title":"The traveling salesman problem and minimum spanning trees","volume":"1","author":"Held","year":"1971","journal-title":"Mathematical Programming"},{"issue":"4","key":"10.1016\/0305-0548(81)90035-6_BIB58","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1287\/opre.26.4.538","article-title":"Optimal design of regional wastewater systems: A fixed-charge network flow model","volume":"26","author":"Jarvis","year":"1978","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(81)90035-6_BIB59","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"issue":"1","key":"10.1016\/0305-0548(81)90035-6_BIB60","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1002\/net.1975.5.1.45","article-title":"On the complexity of combinatorial problems","volume":"5","author":"Karp","year":"1975","journal-title":"Networks"},{"issue":"3","key":"10.1016\/0305-0548(81)90035-6_BIB61","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1287\/moor.2.3.209","article-title":"The probabilistic analysis of partitioning algorithms for the traveling-salesman problem in the plane","volume":"2","author":"Karp","year":"1977","journal-title":"Math. Ops Res."},{"issue":"2","key":"10.1016\/0305-0548(81)90035-6_BIB62","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"},{"issue":"2","key":"10.1016\/0305-0548(81)90035-6_BIB63","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1287\/opre.26.2.209","article-title":"A survey of linear cost multicommodity network flows","volume":"26","author":"Kennington","year":"1978","journal-title":"Ops Res."},{"issue":"4","key":"10.1016\/0305-0548(81)90035-6_BIB64","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(81)90035-6_BIB65","series-title":"Proc. ACM Ann. Con.","first-page":"518","article-title":"Computing minimum spanning trees efficiently","author":"Kershenbaum","year":"1972"},{"key":"10.1016\/0305-0548(81)90035-6_BIB66","article-title":"A family of truck load clustering heuristics for solving vehicle scheduling problems","author":"Krolak","year":"1978"},{"key":"10.1016\/0305-0548(81)90035-6_BIB67","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/BF01584089","article-title":"A solvable case of the TSP","volume":"1","author":"Lawler","year":"1971","journal-title":"Mathematical Programming"},{"issue":"1","key":"10.1016\/0305-0548(81)90035-6_BIB68","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1002\/net.1975.5.1.89","article-title":"Algorithms, graphs, and complexity","volume":"5","author":"Lawler","year":"1975","journal-title":"Networks"},{"key":"10.1016\/0305-0548(81)90035-6_BIB69","series-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler","year":"1976"},{"issue":"1","key":"10.1016\/0305-0548(81)90035-6_BIB70","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/opre.27.1.1","article-title":"Energy policy modeling: a survey","volume":"27","author":"Manne","year":"1979","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(81)90035-6_BIB71","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/BF01584985","article-title":"Optimization of the flow through networks with gains","volume":"3","author":"Maurras","year":"1972","journal-title":"Mathematical Programming"},{"key":"10.1016\/0305-0548(81)90035-6_BIB72","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/BF01580682","article-title":"Integer programming approaches to the traveling salesman problem","volume":"10","author":"Miliotis","year":"1976","journal-title":"Mathematical Programming"},{"issue":"2","key":"10.1016\/0305-0548(81)90035-6_BIB73","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":"Mathematical Programming"},{"key":"10.1016\/0305-0548(81)90035-6_BIB74","series-title":"Project Management with CPM and PERT","author":"Moder","year":"1970"},{"issue":"3","key":"10.1016\/0305-0548(81)90035-6_BIB75","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":"Mathematical Programming"},{"key":"10.1016\/0305-0548(81)90035-6_BIB76","series-title":"Combinatorial Algorithms","author":"Nijenhuis","year":"1975"},{"key":"10.1016\/0305-0548(81)90035-6_BIB77","article-title":"On the symmetric traveling salesman problem: A computational study","author":"Padberg","year":"1977"},{"key":"10.1016\/0305-0548(81)90035-6_BIB78","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":"7","author":"Pape","year":"1974","journal-title":"Mathematical Programming"},{"key":"10.1016\/0305-0548(81)90035-6_BIB79","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1137\/0132031","article-title":"Computing the reliability of complex networks","volume":"32","author":"Rosenthal","year":"1977","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0305-0548(81)90035-6_BIB80","doi-asserted-by":"crossref","first-page":"992","DOI":"10.1287\/opre.18.6.992","article-title":"Optimal design of offshore natural-gas pipeline system","volume":"18","author":"Rothfarb","year":"1970","journal-title":"Ops Res."},{"issue":"6","key":"10.1016\/0305-0548(81)90035-6_BIB81","doi-asserted-by":"crossref","first-page":"920","DOI":"10.1287\/opre.25.6.920","article-title":"General techniques for combinatorial optimization","volume":"25","author":"Sahni","year":"1977","journal-title":"Ops. Res."},{"issue":"5","key":"10.1016\/0305-0548(81)90035-6_BIB82","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1287\/opre.26.5.718","article-title":"Combinatorial problems: Reducibility and approximation","volume":"26","author":"Sahni","year":"1978","journal-title":"Ops Res."},{"issue":"3","key":"10.1016\/0305-0548(81)90035-6_BIB83","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1002\/net.3230060303","article-title":"Interactive methods for determining the k shortest paths in a network","volume":"6","author":"Shier","year":"1976","journal-title":"Networks"},{"issue":"3","key":"10.1016\/0305-0548(81)90035-6_BIB84","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1002\/net.3230090303","article-title":"On algorithms for finding the K shortest paths in a network","volume":"9","author":"Shier","year":"1979","journal-title":"Networks"},{"key":"10.1016\/0305-0548(81)90035-6_BIB85","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":"Mathematical Programming"},{"issue":"2","key":"10.1016\/0305-0548(81)90035-6_BIB86","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1002\/net.3230060207","article-title":"An efficient scaling procedure for gain networks","volume":"6","author":"Truemper","year":"1976","journal-title":"Networks"},{"issue":"1","key":"10.1016\/0305-0548(81)90035-6_BIB87","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1002\/net.1975.5.1.97","article-title":"Stochastic aspects of networks","volume":"5","author":"Van Slyke","year":"1975","journal-title":"Networks"},{"issue":"1","key":"10.1016\/0305-0548(81)90035-6_BIB88","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":"Operational Res. Q."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054881900356?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054881900356?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T16:28:18Z","timestamp":1552926498000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054881900356"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,1]]},"references-count":88,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1981,1]]}},"alternative-id":["0305054881900356"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(81)90035-6","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1981,1]]}}}