The following information was submitted:
Transactions: NUMERICAL SCHEMES AND METHODS IN SCIENCE AND ENGINEERING
Transactions ID Number: 10-186
Full Name: Laura Ciupala
Position: Associate Professor
Age: ON
Sex: Female
Address: Brasov, Iuliu Maniu Str. 50
Country: ROMANIA
Tel: +40 268 414016
Tel prefix:
Fax:
E-mail address: laura_ciupala@yahoo.com
Other E-mails: laura.ciupala@unitbv.ro
Title of the Paper: Characterization of all optimal flows in networks
Authors as they appear in the Paper: L. Ciupală, E. Ciurea
Email addresses of all the authors: laura_ciupala@yahoo.com,laura.ciupala@unitbv.ro,e.ciurea@unitbv.ro
Number of paper pages: 10
Abstract: In this paper, we describe methods for determining all optimal flows in a given network: all minimum flows and all maximum flows. The minimum flow algorithms developed until now determine only a minimum flow, but, usually, there is more than one minimum flow in a network. There are several applications that can be modeled as minimum flow problems in some networks and solved by determining all the minimum flows in those networks. This is the main reason for which we focus on the problem of determining all minimum flows in networks. The same problem arises when solving maximum flow problems. Starting with the well known labeling algorithm by Ford and Ful-kerson, many maximum flow algorithms were developed in the past six decades, but they determine only a maximum flow, although, most of the times, there are several maximum flows.
Keywords: Network flow, network algorithms, maximum flow, minimum flow, minimum cut, maximum cut.
EXTENSION of the file: .doc
Special (Invited) Session: All minimum flows in networks
Organizer of the Session: 646-259
How Did you learn about congress:
IP ADDRESS: 79.116.205.207
