An algorithm for the biobjective integer minimum cost flow problem

In this paper, we study the single commodity flow problems, optimizing two objectives simultaneously, where the flow values must be integer values. We propose a method that finds all the efficient integer points in the objective space. Our algorithm performs two phases. In the first phase, all integ...

Full description

Bibliographic Details

Published in:	Computers & operations research Vol. 28; no. 2; pp. 139 - 156
Main Authors:	Sedeño-Noda, A., González-Martı́n, C.
Format:	Journal Article
Language:	English
Published:	New York Elsevier Ltd 01.02.2001 Pergamon Press Inc
Subjects:	Algorithms Biobjective integer minimum cost flow problem Computer programming Integer programming Network programming Operations research Studies Biobjective integer minimum cost flow problem Network programming
ISSN:	0305-0548, 1873-765X, 0305-0548
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!