A note on K best network flows

A note on K best network flows

0.00 Avg rating—0 Votes
Article ID: iaor19952263
Country: Switzerland
Volume: 57
Issue: 1
Start Page Number: 65
End Page Number: 72
Publication Date: Jun 1995
Journal: Annals of Operations Research
Authors:
Keywords: decision theory: multiple criteria
Abstract:

It is shown that the problem of finding the K best solutions of a linear integer network flow problem can be solved by a polynomial time algorithm. This algorithm can be used in order to solve a multiple-criteria network flow problem which minimizes the maximum of Q objectives.

Reviews

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