## The Fixed-charge Transportation Problem: A Group Theoretic/branch-and-bound AlgorithmDepartment of Computer Science and Operations Research, Southern Methodist University, Institute of Technology, 1973 - Branch and bound algorithms - 26 pages |

### What people are saying - Write a review

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

### Other editions - View all

### Common terms and phrases

ALG-3 terminates arcs assuming the value basic branch-and-bound algorithm candidate list CM CM CM CO 00 cn CM completes the proof component computational experience constraints cost dominated cost structure DEFINITION denote the cost denote the vector determine the separation DPEN(y Fathom fixed cost fixed-charge transportation problem flow in CPR Georgia Institute Go to step graph group elements group problem objective GROUP THEORETIC ALGORITHM group theoretic approach incidence matrix incumbent index set Institute of Technology integer programming problem ith row Jeremy F node nonbasic variables number of iterations obtained OOT-OZ Operations Research Center optimal basis optimal dual variables optimal solution problem size problems from CL procedure proof of proposition root separation variable Shapiro side restrictions simple path solution to FCTP solved spanning forest St St step 14 step 17 Step 21 subgraph Table trees equal TT=u Univac variable cost vertices