A non improving simplex algorithm for transportation problems
A non-dual signature method for the assignment problem and a generalization of the dual simplex method for the transportation problem
On a dual network exterior point simplex type algorithm and its computational behavior
The minimum cost network flow problem, (MCNFP) constitutes a wide category of network flow problems. Recently a new dual network exterior point simplex algorithm (DNEPSA) for the MCNFP has been developed. This algorithm belongs to a special “exterior point simplex type” category. Similar to the classical dual network simplex algorithm (DNSA), this algorithm starts with a dual feasible tree-solution and after a number of iterations, it produces a solution that is both primal and dual feasible, it...
On a dual network exterior point simplex type algorithm and its computational behavior
The minimum cost network flow problem, (MCNFP) constitutes a wide category of network flow problems. Recently a new dual network exterior point simplex algorithm (DNEPSA) for the MCNFP has been developed. This algorithm belongs to a special “exterior point simplex type” category. Similar to the classical dual network simplex algorithm (DNSA), this algorithm starts with a dual feasible tree-solution and after a number of iterations, it produces a...
A New Exterior Point Algorithm for Linear Programming Problems
A Dual Exterior Point Simplex Type Algorithm for the Minimum Cost Network Flow Problem
A Parametric Visualization Software for the Assignment Problem
Risk-Based Decision Making and Risk Management of European Union Regional Programs
A Genetic Algorithm Approach to the Buyers' Welfare Problem of Product Line Design: A Comparative Computational Study
Page 1