E. Andrew Boyd On the Complexity of a Cutting Plane Algorithm for Solving Combinatorial Linear Programs. [Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 1996, v:9, n:3, pp:365-376 [Journal]

An algorithmic characterization of antimatroids. [Citation Graph (, )][DBLP]

Search in 0.003secs, Finished in 0.003secs

NOTICE1

System may not be available sometimes or not working properly, since it is still in development with continuous upgrades

NOTICE2

The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP