A GENERAL DETERMINISTIC PIVOT METHOD FOR ORIENTED MATROID PROGRAMMING
Citation：
Wang Zhemin（王哲民）.A GENERAL DETERMINISTIC PIVOT METHOD FOR ORIENTED MATROID PROGRAMMING[J].Chinese Annals of Mathematics B,1992,13(2):222~229
Page view： 753Net amount： 907
Authors：
Wang Zhemin（王哲民）;
Abstract：
A new pivot method for oriented matroid programming is given out.This method is deterministic by nature and is general in the sense that its flexible pivot selection rule allows a family of possible algorithms to be its special cases,including the so called criss-cross algorithm and the Edmonds-Fukuda algorithm as well.As an example of a special implementation of our general method,an extended version of the Edmonds-Fukuda algorithm is presented.
