By Topic

Parallel computing for network optimization: a cluster-based approach for the dual transshipment problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
R. P. Chalasani ; Cadence Design Syst. Inc., San Jose, CA, USA ; K. Thulasiraman

The traditional simplex method for solving the transshipment problem or its dual does not offer much scope for parallelization because it moves from one basic solution to another. To address this problem, we recently presented a new method called the Modified Network Dual Simplex method. This method incorporates two novel features: a technique to convert a non-basic dual feasible solution to a basic dual feasible solution, and strategies for performing pivots concurrently. In a more recent paper (1994), theauthors discuss the suitability of this approach in the Integrated VLSI layout compaction and wire balancing problem. In this paper, we describe another novel method for solving the dual transshipment problem. It combines the concurrent pivoting strategies of with a massively parallel method for converting a non-basic feasible solution to a basic feasible solution (without reducing the objective value). The method employs extensively the notion of cluster firing. Results of testing of this method on large scale graphs are also presented

Published in:

Parallel and Distributed Processing, 1995. Proceedings. Seventh IEEE Symposium on

Date of Conference:

25-28 Oct 1995