Parallelizing the dual simplex method von Bixby, Robert E., Martin, Alexander 1965-

Finding embedded network rows in linear programs von Bixby, Robert E.

Finding a small 3-connected minor maintaining a fixed minor and a fixed element von Bixby, Robert E.

On chains of 3-connected matroids von Bixby, Robert E.

Adjoints of binary matroids von Bixby, Robert E.

Parallelizing the dual simplex method von Bixby, Robert E.

Das Implementieren des Simplex-Verfahrens die Startbasis von Bixby, Robert E.

A note on detecting simple redundancies in linear systems von Bixby, Robert E.

Packing and covering with integral flows in integral supply-demand networks von Bixby, Robert E.

Short cocircuits in binary matroids von Bixby, Robert E.

The Traveling Salesman problem a computational study von Applegate, David L., Bixby, Robert E., Chvátal, Vašek 1946-, Cook, William 1957-

TUM01
UER01
Volltext
Volltext

Matroid optimization and algorithms von Bixby, Robert E., Cunningham, William H.

An almost linear-time algorithm for graph realization von Bixby, Robert E.

Finding embedded network rows in linear programs von Bixby, Robert E.