M. A. Comeau

  • Citations Per Year
Learn More
We Present a parallel algorithm for solving the dual transshipment problem [ l I. The traditional dual simplex method does not offer much scope for parallelization, because it moves from one basic feasible solution to another, performing one pivot operation at a time. We present a new method called Mod@ed Network Dual Simpler method which uses concurrent(More)
We present U uniJied approuch to the layout compaction und wire balancingproblem. We show that the layout compaction problem can be solved by an algorithm which also solves the primal-dual initialization problem. We formulate the wire balancing problem as a transshipment problem and show that the results of the compaction problem can also used to initialize(More)
An ISDN user access strategy for wideband and narrowband traffic is studied. Wideband traffic is assumed to be blocked, while narrowband traffic is allowed to queue up. Each user may require a random number of bandwidth units (slots). The exact blocking probability for the wideband users is given, while an approximate solution is given for the message delay(More)
  • 1