{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,11]],"date-time":"2026-08-11T23:29:22Z","timestamp":1786490962687,"version":"3.56.0"},"reference-count":28,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2002,8,1]],"date-time":"2002-08-01T00:00:00Z","timestamp":1028160000000},"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":["European Journal of Operational Research"],"published-print":{"date-parts":[[2002,8]]},"DOI":"10.1016\/s0377-2217(01)00239-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:23:30Z","timestamp":1027639410000},"page":"629-647","source":"Crossref","is-referenced-by-count":37,"title":["The transportation problem with exclusionary side constraints and two branch-and-bound algorithms"],"prefix":"10.1016","volume":"140","author":[{"given":"Minghe","family":"Sun","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(01)00239-9_BIB1","series-title":"Network Flows","author":"Ahuja","year":"1993"},{"issue":"3","key":"10.1016\/S0377-2217(01)00239-9_BIB2","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1287\/opre.29.3.448","article-title":"A new optimization method for large scale fixed charge transportation problems","volume":"29","author":"Barr","year":"1981","journal-title":"Operations Research"},{"issue":"1","key":"10.1016\/S0377-2217(01)00239-9_BIB3","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 Science"},{"key":"10.1016\/S0377-2217(01)00239-9_BIB4","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/BF01417216","article-title":"Transportation problems with nonlinear side constraints: A branch-and-bound approach","volume":"36","author":"Cao","year":"1992","journal-title":"Zeitschrift fuer Operations Research"},{"issue":"6","key":"10.1016\/S0377-2217(01)00239-9_BIB5","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1016\/0305-0548(94)00055-D","article-title":"Solving transportation problems with nonlinear side constraints with tabu search","volume":"22","author":"Cao","year":"1995","journal-title":"Computers and Operations Research"},{"issue":"1","key":"10.1016\/S0377-2217(01)00239-9_BIB6","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/net.3230070105","article-title":"A primal algorithm for solving a capacitated network flow problem with additional linear constraints","volume":"7","author":"Chen","year":"1977","journal-title":"Networks"},{"issue":"3","key":"10.1016\/S0377-2217(01)00239-9_BIB7","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1093\/comjnl\/8.3.250","article-title":"A tree search algorithm for mixed integer programming problems","volume":"8","author":"Dakin","year":"1965","journal-title":"Computer Journal"},{"issue":"7","key":"10.1016\/S0377-2217(01)00239-9_BIB8","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1287\/mnsc.12.7.576","article-title":"An algorithm for the solution of mixed integer programming problems","volume":"12","author":"Driebeek","year":"1966","journal-title":"Management Science"},{"issue":"9","key":"10.1016\/S0377-2217(01)00239-9_BIB9","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1287\/mnsc.18.9.465","article-title":"Integer programming algorithms: A framework and state-of-the-art survey","volume":"18","author":"Geoffrion","year":"1972","journal-title":"Management Science"},{"issue":"3","key":"10.1016\/S0377-2217(01)00239-9_BIB10","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1002\/net.3230040302","article-title":"Implementation and computational comparisons of primal, dual and primal\u2013dual computer codes for minimum cost network flow problems","volume":"4","author":"Glover","year":"1974","journal-title":"Networks"},{"issue":"4","key":"10.1016\/S0377-2217(01)00239-9_BIB11","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1287\/trsc.12.4.277","article-title":"Solving singly constrained transshipment problems","volume":"12","author":"Glover","year":"1978","journal-title":"Transportation Science"},{"key":"10.1016\/S0377-2217(01)00239-9_BIB12","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BFb0121048","article-title":"Basis exchange characterizations for the simplex SON algorithm for LP\/Embedded networks","volume":"24","author":"Glover","year":"1985","journal-title":"Mathematical Programming Study"},{"key":"10.1016\/S0377-2217(01)00239-9_BIB13","series-title":"Network Models in Optimization and Their Applications in Practice","author":"Glover","year":"1992"},{"issue":"3","key":"10.1016\/S0377-2217(01)00239-9_BIB14","first-page":"293","article-title":"Augmented threaded index method for network optimization","volume":"12","author":"Glover","year":"1974","journal-title":"INFOR"},{"key":"10.1016\/S0377-2217(01)00239-9_BIB15","series-title":"Tabu Search","author":"Glover","year":"1997"},{"issue":"2","key":"10.1016\/S0377-2217(01)00239-9_BIB16","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1080\/05695557608975073","article-title":"The fixed charge transportation problem: A computational study with a branch-and-bound code","volume":"8","author":"Kennington","year":"1976","journal-title":"AIIE Transactions"},{"key":"10.1016\/S0377-2217(01)00239-9_BIB17","series-title":"Algorithms for Network Programming","author":"Kennington","year":"1980"},{"issue":"10","key":"10.1016\/S0377-2217(01)00239-9_BIB18","doi-asserted-by":"crossref","first-page":"1116","DOI":"10.1287\/mnsc.22.10.1116","article-title":"A new branch-and-bound algorithm for the fixed charge transportation problem","volume":"22","author":"Kennington","year":"1976","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(01)00239-9_BIB19","unstructured":"Kennington, J., Whisman, A., 1987. NETSIDE User's Guide. Technical Report 86-OR-01, Department of Operations Research, SMU, Dallas, TX 75275"},{"key":"10.1016\/S0377-2217(01)00239-9_BIB20","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1287\/opre.23.1.91","article-title":"Solving constrained transportation problems","volume":"23","author":"Klingman","year":"1975","journal-title":"Operations Research"},{"issue":"10","key":"10.1016\/S0377-2217(01)00239-9_BIB21","doi-asserted-by":"crossref","first-page":"1431","DOI":"10.1287\/mnsc.43.10.1431","article-title":"Revised-modified penalties for the fixed charge transportation problem","volume":"43","author":"Lamar","year":"1997","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(01)00239-9_BIB22","series-title":"Network Programming","author":"Murty","year":"1992"},{"key":"10.1016\/S0377-2217(01)00239-9_BIB23","series-title":"Integer and Combinatorial Optimization","author":"Nemhauser","year":"1988"},{"issue":"9","key":"10.1016\/S0377-2217(01)00239-9_BIB24","doi-asserted-by":"crossref","first-page":"1092","DOI":"10.1287\/mnsc.36.9.1092","article-title":"A branch-and-bound method for the fixed charge transportation problem","volume":"36","author":"Palekar","year":"1990","journal-title":"Management Science"},{"issue":"4","key":"10.1016\/S0377-2217(01)00239-9_BIB25","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1145\/321724.321734","article-title":"Accelerated algorithms for labeling and relabeling of trees with application for distribution problems","volume":"19","author":"Srinivasan","year":"1972","journal-title":"Journal of the Association for Computing Machinery"},{"issue":"4","key":"10.1016\/S0377-2217(01)00239-9_BIB26","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1023\/A:1009630528341","article-title":"A tabu search heuristic procedure for solving the transportation problem with exclusionary side constraints","volume":"3","author":"Sun","year":"1998","journal-title":"Journal of Heuristics"},{"issue":"4","key":"10.1016\/S0377-2217(01)00239-9_BIB27","doi-asserted-by":"crossref","first-page":"1070","DOI":"10.1287\/opre.19.4.1070","article-title":"An improved branch and bound method for integer programming","volume":"19","author":"Tomlin","year":"1971","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(01)00239-9_BIB28","series-title":"Integer Programming","author":"Wolsey","year":"1998"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221701002399?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221701002399?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T11:20:52Z","timestamp":1555154452000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221701002399"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,8]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,8]]}},"alternative-id":["S0377221701002399"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(01)00239-9","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2002,8]]}}}