The following information was submitted:
Transactions: INTERNATIONAL JOURNAL of APPLIED MATHEMATICS AND INFORMATICS
Transactions ID Number: 20-856
Full Name: Mircea Parpalea
Position: Ph.D. Candidate
Age: ON
Sex: Male
Address: str. C.D.Gherea nr.17, Brasov, Romania
Country: ROMANIA
Tel:
Tel prefix:
Fax:
E-mail address: parpalea@gmail.com
Other E-mails: e.ciurea@ unitbv.ro
Title of the Paper: The quickest maximum dynamic flow of minimum cost
Authors as they appear in the Paper: Mircea Parpalea and Eleonor Ciurea
Email addresses of all the authors: parpalea@gmail.com,e.ciurea@ unitbv.ro
Number of paper pages: 9
Abstract: This article states and solves the multi-criteria maximum flow problem in discrete dynamic networks for the case of two objective functions. This represents a generalisation of the maximum flow of minimum cost problem for the case of minimizing the travelling cost (minimum cost flow) and travelling time (quickest flow). The approach is actually based on generating efficient extreme points in the objective space by iteratively solving a series of maximum flow problems with different single objective functions. Each time, the dynamic flow is augmented along a cheapest (minimum cost) path from the source node to the sink node in the time-space network avoiding the explicit time expansion of the network.
Keywords: Bi-criteria flow, Discrete dynamic network, Dynamic maximum flow, Successive shortest path
EXTENSION of the file: .doc
Special (Invited) Session: Maximum Flow of Minimum Bi-criteria Cost in Dynamic Networks
Organizer of the Session: 659-262
How Did you learn about congress:
IP ADDRESS: 79.116.254.203
