Bicriteria network flow problems: Continuous case

Bicriteria network flow problems: Continuous case

0.00 Avg rating0 Votes
Article ID: iaor1993769
Country: Netherlands
Volume: 51
Issue: 1
Start Page Number: 119
End Page Number: 126
Publication Date: Mar 1991
Journal: European Journal of Operational Research
Authors:
Keywords: programming: multiple criteria
Abstract:

An algorithm for bicriteria network flow problems is developed. It deals with a broader class of minimum cost network flow problems which include transportation, maximum flow, assignment, shortest path, and transshipment problems rather than a specific one. The algorithm integrates bicriteria mathematical programming theory with the out-of-kilter method.

Reviews

Required fields are marked *. Your email address will not be published.