{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T08:48:47Z","timestamp":1758271727598},"reference-count":33,"publisher":"Elsevier BV","issue":"7","license":[{"start":{"date-parts":[[1992,10,1]],"date-time":"1992-10-01T00:00:00Z","timestamp":717897600000},"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":[[1992,10]]},"DOI":"10.1016\/0305-0548(92)90034-3","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T12:15:45Z","timestamp":1056975345000},"page":"649-655","source":"Crossref","is-referenced-by-count":19,"title":["Efficient solutions for the bicriteria network flow problem"],"prefix":"10.1016","volume":"19","author":[{"given":"P.Simin","family":"Pulat","sequence":"first","affiliation":[]},{"given":"Fenghueih","family":"Huarng","sequence":"additional","affiliation":[]},{"given":"Haijune","family":"Lee","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(92)90034-3_BIB1","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1287\/mnsc.25.1.73","article-title":"Bicriteria transportation problem","volume":"25","author":"Aneja","year":"1979","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(92)90034-3_BIB2","series-title":"Linear Programming and Network Flows","author":"Bazaraa","year":"1990"},{"key":"10.1016\/0305-0548(92)90034-3_BIB3","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1016\/0377-2217(82)90205-3","article-title":"A bicriterion shortest path algorithm","volume":"11","author":"Climaco","year":"1982","journal-title":"Eur. J. Opl Res."},{"key":"10.1016\/0305-0548(92)90034-3_BIB4","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1287\/moor.4.2.196","article-title":"Theoretical properties of the network simplex method","volume":"4","author":"Cunningham","year":"1979","journal-title":"Math. Ops Res."},{"key":"10.1016\/0305-0548(92)90034-3_BIB5","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0377-2217(83)90079-6","article-title":"A resolution method for multiobjective problems","volume":"13","author":"Delgado","year":"1983","journal-title":"Eur. J. Opl Res."},{"key":"10.1016\/0305-0548(92)90034-3_BIB6","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/BF00935493","article-title":"Generating all maximal efficient faces for multiple objective linear programs","volume":"30","author":"Ecker","year":"1980","journal-title":"J. Optimiza. Appl."},{"key":"10.1016\/0305-0548(92)90034-3_BIB7","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/BF01580453","article-title":"Finding efficient points for linear multiple objective programs","volume":"8","author":"Ecker","year":"1975","journal-title":"Math. Prog."},{"key":"10.1016\/0305-0548(92)90034-3_BIB8","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/BF01588968","article-title":"Finding all efficient extreme points for multiple objective linear programs","volume":"14","author":"Ecker","year":"1978","journal-title":"Mathl Prog."},{"key":"10.1016\/0305-0548(92)90034-3_BIB9","article-title":"Geometric approach to multiple objective optimization with applications to multiple criteria decision making","author":"El-Abayad","year":"1986"},{"key":"10.1016\/0305-0548(92)90034-3_BIB10","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1007\/BF01580111","article-title":"A revised simplex method for linear multiple objective programs","volume":"5","author":"Evans","year":"1973","journal-title":"Mathl Prog."},{"key":"10.1016\/0305-0548(92)90034-3_BIB11","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0377-2217(77)90063-7","article-title":"A general method for determining the set of all efficient solutions to a linear vectormaximum problem","volume":"1","author":"Gal","year":"1977","journal-title":"Eur. J. Opl Res."},{"key":"10.1016\/0305-0548(92)90034-3_BIB12","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1002\/nav.3800020106","article-title":"The computational algorithm for the parametric objective function","volume":"2","author":"Gass","year":"1955","journal-title":"Nav. Res. Logist. Q"},{"key":"10.1016\/0305-0548(92)90034-3_BIB13","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1002\/net.3230200108","article-title":"Anti-stalling pivot rules for the network simplex algorithm","volume":"20","author":"Goldfarb","year":"1990","journal-title":"Networks"},{"key":"10.1016\/0305-0548(92)90034-3_BIB14","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1287\/opre.22.1.189","article-title":"Proper efficient and linear vector maximum problem","volume":"22","author":"Isermann","year":"1976","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(92)90034-3_BIB15","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1057\/jors.1977.147","article-title":"The enumeration of the set of all efficient solutions for a linear multiple objective program","volume":"28","author":"Isermann","year":"1977","journal-title":"Opl Res. Q."},{"key":"10.1016\/0305-0548(92)90034-3_BIB16","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1002\/nav.3800260112","article-title":"The enumeration of the set of all efficient solutions for a linear multi-objective transportation problem","volume":"26","author":"Isermann","year":"1979","journal-title":"Nav. Res. Logist. Q"},{"key":"10.1016\/0305-0548(92)90034-3_BIB17","first-page":"1","article-title":"Solution approaches for network flow problems with multiple criteria","volume":"1","author":"Klingman","year":"1982","journal-title":"Adv. Mgmt Stud."},{"key":"10.1016\/0305-0548(92)90034-3_BIB18","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1287\/mnsc.20.5.814","article-title":"NETGEN\u2014a program for generating large scale (un) capacitated assignment, transportation and minimum cost flow network problems","volume":"20","author":"Klingman","year":"1974","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(92)90034-3_BIB19","series-title":"Working Paper 88-6","article-title":"Bicriteria network flow problems: continuous case","author":"Lee","year":"1989"},{"key":"10.1016\/0305-0548(92)90034-3_BIB20","series-title":"Working Paper 89-2","article-title":"Bicriteria network flow problems: integer case","author":"Lee","year":"1989"},{"key":"10.1016\/0305-0548(92)90034-3_BIB21","first-page":"95","article-title":"Bi-criteria network problem","volume":"26","author":"Malhotra","year":"1984","journal-title":"Cah.-Centre Etud. Rech. Opnelle"},{"key":"10.1016\/0305-0548(92)90034-3_BIB22","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1016\/0377-2217(84)90077-8","article-title":"On a multicriteria shortest path problem","volume":"16","author":"Martins","year":"1984","journal-title":"Eur. J. Opl Res."},{"key":"10.1016\/0305-0548(92)90034-3_BIB23","first-page":"235","article-title":"A transportation problem with objectives to minimize total cost and duration of transportation","volume":"18","author":"Prakash","year":"1981","journal-title":"Opsearch"},{"key":"10.1016\/0305-0548(92)90034-3_BIB24","first-page":"126","article-title":"Nondominated solutions of cost-time trade-off transportation and assignment problems","volume":"25","author":"Prakash","year":"1988","journal-title":"Opsearch"},{"key":"10.1016\/0305-0548(92)90034-3_BIB25","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/0377-2217(87)90274-8","article-title":"Interactive solutions for the linear multiobjective transportation problem","volume":"32","author":"Ringuest","year":"1987","journal-title":"Eur. J. Opl Res."},{"key":"10.1016\/0305-0548(92)90034-3_BIB26","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1111\/j.1540-5915.1985.tb01479.x","article-title":"Concepts, theory and techniques\u2014principles of multiobjective optimization","volume":"16","author":"Rosenthal","year":"1985","journal-title":"Decn Sci."},{"key":"10.1016\/0305-0548(92)90034-3_BIB27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.11.1.1","article-title":"Determining cost vs. time Pareto optimal frontiers in multi-modal transportation problems","volume":"11","author":"Srinivasan","year":"1977","journal-title":"Transpn Sci."},{"key":"10.1016\/0305-0548(92)90034-3_BIB28","series-title":"ADBASE: An Adjacent Efficient Basis Algorithm for Solving Vector-maximum and Interval Weighted Sums Linear Programming Problems (in FORTRAN)","author":"Steuer","year":"1976"},{"key":"10.1016\/0305-0548(92)90034-3_BIB29","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1287\/opre.35.1.70","article-title":"Approximation of Pareto optimal in multiple-objective, shortest-path problems","volume":"35","author":"Warburton","year":"1987","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(92)90034-3_BIB30","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0305-0548(82)90008-9","article-title":"The set of efficient solutions for multiple objective shortest path problems","volume":"9","author":"White","year":"1982","journal-title":"Computers Ops Res."},{"key":"10.1016\/0305-0548(92)90034-3_BIB31","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1057\/jors.1984.152","article-title":"A special multiobjective assignment problem","volume":"35","author":"White","year":"1984","journal-title":"J. Opl Res. Soc."},{"key":"10.1016\/0305-0548(92)90034-3_BIB32","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1016\/0022-247X(75)90189-4","article-title":"The set of all nondominated solutions in linear cases and a multicriteria simplex method","volume":"49","author":"Yu","year":"1975","journal-title":"J. Mathl Anal. Appl."},{"key":"10.1016\/0305-0548(92)90034-3_BIB33","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1287\/mnsc.29.5.519","article-title":"An interactive multiple objective linear programming method for a class of underlying nonlinear utility functions","volume":"29","author":"Zionts","year":"1983","journal-title":"Mgmt Sci."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054892900343?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054892900343?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T13:23:25Z","timestamp":1552915405000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054892900343"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,10]]},"references-count":33,"journal-issue":{"issue":"7","published-print":{"date-parts":[[1992,10]]}},"alternative-id":["0305054892900343"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(92)90034-3","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1992,10]]}}}