MULTICOMMODITY NETWORK PROBLEMS - APPLICATIONS AND COMPUTATIONS Academic Article

abstract

• It is well documented that pure network problems can be solved from 10 to 100 times faster using specialized primal simplex software as compared to general linear programming systems. For multicommodity network flow problems, the computational savings are a function of the number of tight-side constraints. In this study, we present three real-world multicommodity models and data concerning the number of tight-side constraints. We also present the results of a computational study on a set of 25 randomly generated test problems which have a wide range of number of tight-side constraints. We conclude that a specialized multicommodity network code is three times as fast as a general code, while a specialized network with general side constraints code has twice the speed of a general LP code. 1984 Taylor & Francis Group, LLC.

authors

• Mccarl, Bruce
• Shetty, Bala

published proceedings

• IIE TRANSACTIONS

author list (cited authors)

• ALI, I., BARNETT, D., FARHANGIAN, K., KENNINGTON, J., PATTY, B., SHETTY, B., MCCARL, B., & WONG, P.

citation count

• 27

complete list of authors

• ALI, I||BARNETT, D||FARHANGIAN, K||KENNINGTON, J||PATTY, B||SHETTY, B||MCCARL, B||WONG, P

publication date

• June 1984

publisher

• Taylor & Francis  Publisher

published in

• IIE Transactions  Journal

Digital Object Identifier (DOI)

• 10.1080/07408178408974677

start page

• 127

end page

• 134

volume

• 16

issue

• 2

URL

• http://dx.doi.org/10.1080/07408178408974677