{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T06:22:16Z","timestamp":1769235736908,"version":"3.49.0"},"reference-count":13,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2001,2,1]],"date-time":"2001-02-01T00:00:00Z","timestamp":980985600000},"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":[[2001,2]]},"DOI":"10.1016\/s0305-0548(99)00095-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:23:35Z","timestamp":1027607015000},"page":"139-156","source":"Crossref","is-referenced-by-count":36,"title":["An algorithm for the biobjective integer minimum cost flow problem"],"prefix":"10.1016","volume":"28","author":[{"given":"A.","family":"Sede\u00f1o-Noda","sequence":"first","affiliation":[]},{"given":"C.","family":"Gonz\u00e1lez-Mart\u0131\u0301n","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(99)00095-7_BIB1","unstructured":"Ahuja R, Magnanti T, Orlin JB. Network flows. Englewood Cliffs, NJ: Prentice-Hall, 1993."},{"key":"10.1016\/S0305-0548(99)00095-7_BIB2","doi-asserted-by":"crossref","unstructured":"Aneja YP, Nair KP. Bicriteria transportation problem. Management Science 1979;25(1).","DOI":"10.1287\/mnsc.25.1.73"},{"issue":"9","key":"10.1016\/S0305-0548(99)00095-7_BIB3","doi-asserted-by":"crossref","first-page":"971","DOI":"10.1016\/0305-0548(94)00082-J","article-title":"An approach for the network flow problem with multiple objectives","volume":"22","author":"Calvete","year":"1995","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0305-0548(99)00095-7_BIB4","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\/S0305-0548(99)00095-7_BIB5","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1002\/nav.3800260112","article-title":"The enumeration of all efficient solutions for a linear multiple-objective Transportation problem","volume":"26","author":"Isermann","year":"1979","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/S0305-0548(99)00095-7_BIB6","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1287\/mnsc.20.5.814","article-title":"NETGEN-a program for generating large scale (un) capacitated assignment, transportation and minimum cost flow network problems","volume":"20","author":"Klingman","year":"1974","journal-title":"Management Science"},{"issue":"1","key":"10.1016\/S0305-0548(99)00095-7_BIB7","first-page":"1","article-title":"Solution approaches for network flow problems with multiple criteria","volume":"1","author":"Klingman","year":"1982","journal-title":"Advances in Management Studies"},{"key":"10.1016\/S0305-0548(99)00095-7_BIB8","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0377-2217(91)90151-K","article-title":"Bicriteria network flow problems: Continuous case","volume":"51","author":"Lee","year":"1991","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(99)00095-7_BIB9","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1016\/0377-2217(93)90213-7","article-title":"Bicriteria network flow problems: Integer case","volume":"66","author":"Lee","year":"1993","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(99)00095-7_BIB10","first-page":"95","article-title":"Bi-criteria network problem","volume":"26","author":"Malhotra","year":"1984","journal-title":"cahiers due C.E.R.O"},{"issue":"7","key":"10.1016\/S0305-0548(99)00095-7_BIB11","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1016\/0305-0548(92)90034-3","article-title":"Efficient solutions for the bicriteria network flow problem","volume":"19","author":"Pulat","year":"1992","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0305-0548(99)00095-7_BIB12","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":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(99)00095-7_BIB13","doi-asserted-by":"crossref","unstructured":"Sede\u00f1o-Noda A, Gonz\u00e1lez-Mart\u0131\u0301n C. The biobjective minimum cost flow problem. European Journal of Operational Research, in press.","DOI":"10.1016\/S0377-2217(99)00191-5"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054899000957?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054899000957?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T10:21:50Z","timestamp":1556446910000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054899000957"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,2]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2001,2]]}},"alternative-id":["S0305054899000957"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(99)00095-7","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2001,2]]}}}