Searching for "A combinatorial abstraction of linear programming." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

2 documents found, showing 1 through 2.

New finite pivoting rules for the simplex method
by Robert G. Bland, Robert G. Bland — 1977 — Mathematics of Operations Research
… these rules arose: a combinatorial abstraction of linear programming in which only the signs of the tableau…
Cited by 32 (0 self) – Add To MetaCart

Euclideaness and final polynomials in oriented matroid theory, Combinatorica
by Jürgen Richter-gebert — 1993
… polynomial. 3. Oriented matroid programming Bland [2] developed oriented matroid theory as a combinatorial…
Cited by 1 (0 self) – Add To MetaCart

Showing 1 through 2.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB