## Algorithmic and Computational Results for Constrained Transportation, Network and Assignment Models |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

A COMPUTATIONAL STUDY OF THE EFFECTS | 57 |

A BRANCH AND BOUND ALGORITHM FOR | 76 |

CONCLUSIONS | 94 |

2 other sections not shown

### Common terms and phrases

agent algorithm for solving arcs directed assigned a value assigned multipliers assignment models assumption branch and bound Chapter Charnes column computational results constrained transportation problem constraint is equivalent demand destination constraints determine disjoint sets dissertation dual efficient equations equivalent bounded sum equivalent constraint equivalent partial sum feasible solution FINDING EQUIVALENT formulation go to step included INITIAL BASIS integer programming jeN-S kEN k Klingman linear combination linear transformation lower bound method minimum cost multiple assignments network problem number of constraints number of origin number of pivots number of variables objective function Operations Research optimal solution origin constraint primal simplex transportation procedures developed rectangular problems satisfied set equal simplex algorithm single node constraint solution time increases specialized algorithms starred cells straints subnetwork subset sum of variables supply Table tasks total number total solution transhipment and assignment transhipment problem transportation model Transportation Tableau University of Texas Wagner 47