A history of scientific computing
Mathematical and Computer Modelling: An International Journal
Valid integer polytope (VIP) penalties for branch-and-bound enumeration
Operations Research Letters
Basis properties and algorithmic specializations for gub transformed networks
Operations Research Letters
The linear multiple choice knapsack problem
Operations Research Letters
Implementing the simplex method as a cutting-plane method, with a view to regularization
Computational Optimization and Applications
Hi-index | 0.00 |
A variant of the revised simplex method is given for solving linear programs with M+L equations, L of which have the property that each variable has at most one nonzero coefficient in them. Special cases include transportation problems, programs with upper bounded variables, assignment and weighted distribution problems. The algorithm described uses a working basis of M rows for pivoting, pricing, and inversion which for large L can result in a substantial reduction of computation. This working basis is only MxM and is a further reduction of the size found in an earlier version.