Standard computer implementations of Dantzig's simplex method for linear programming are based upon forming the inverse of the basic matrix and updating the inverse ...
Abstract: A linear programming method for fault restoration is proposed, which considering the dynamic island partition and balanced node. Firstly, the analytical expression of the mapping between the ...
Abstract: The first linear programming bound is the best known asymptotic upper bound for binary codes, for a certain subrange of distances. Starting from the work of Friedman and Tillich (2005), ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results