ℓ-matrices and a characterization of binary matroids. - Robert E. Bixby (Discret. Math., 1974)

The Minimum Number of Edges and Vertices in a Graph with Edge Connectivity n and m n-Bonds. - Robert E. Bixby (Networks, 1975)

A simple proof that every matroid is an intersection of fundamental transversal matroids. - Robert E. Bixby (Discret. Math., 1977)

Kuratowski's and Wagner's theorems for matroids. - Robert E. Bixby (J. Comb. Theory B, 1977)

The solution to a matroid problem of Knuth. - Robert E. Bixby (Discret. Math., 1978)

On Reid's characterization of the ternary matroids. - Robert E. Bixby (J. Comb. Theory B, 1979)

Converting Linear Programs to Network Problems. - Robert E. Bixby; William H. Cunningham (Math. Oper. Res., 1980)

The Partial Order of a Polymatroid Extreme Point. - Robert E. Bixby; William H. Cunningham; Donald M. Topkis (Math. Oper. Res., 1985)

On chains of 3-connected matroids. - Robert E. Bixby; Collette R. Coullard (Discret. Appl. Math., 1986)

Finding a small 3-connected minor maintaining a fixed minor and a fixed element. - Robert E. Bixby; Collette R. Coullard (Comb., 1987)

Short Cocircuits in Binary Matroids. - Robert E. Bixby; William H. Cunningham (Eur. J. Comb., 1987)

Packing and covering with integral feasible flows in integral supply-demand networks. - Robert E. Bixby; Odile M.-C. Marcotte; Leslie E. Trotter Jr. (Math. Program., 1987)

Adjoints of Binary Matroids. - Robert E. Bixby; Collette R. Coullard (Eur. J. Comb., 1988)

An Almost Linear-Time Algorithm for Graph Realization. - Robert E. Bixby; Donald K. Wagner (Math. Oper. Res., 1988)

Implementing the Simplex Method: The Initial Basis. - Robert E. Bixby (INFORMS J. Comput., 1992)

Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods. - Robert E. Bixby; John W. Gregory; Irvin J. Lustig; Roy E. Marsten; David F. Shanno (Oper. Res., 1992)

Automatic Data Layout Using 0-1 Integer Programming. - Robert E. Bixby; Ken Kennedy; Ulrich Kremer (IFIP PACT, 1994)

Numerical Optimization At the Center for Research On Parallel Computation. - Brett M. Averick; Christian H. Bischof; Robert E. Bixby; Alan Carle; John E. Dennis Jr.; Mahmoud El-Alem; Amr El-Bakry; Andreas Griewank; G. Johnson; Robert M. Lewis; Jorge J. Moré; Richard A. Tapia; et al. (Int. J. High Perform. Comput. Appl., 1994)

Commentary - Progress in Linear Programming. - Robert E. Bixby (INFORMS J. Comput., 1994)

Recovering an optimal LP basis from an interior point solution. - Robert E. Bixby; Matthew J. Saltzman (Oper. Res. Lett., 1994)

Solving Nonlinear Integer Programs with a Subgradient Approach on Parallel Computers. - Robert E. Bixby; John M. Dennis; Zhijun Wu (Applications on Advanced Architecture Computers, 1996)

Solving a Truck Dispatching Scheduling Problem Using Branch-and-Cut. - Robert E. Bixby; Eva K. Lee (Oper. Res., 1998)

MIP: Theory and Practice - Closing the Gap. - Robert E. Bixby; Mary Fenelon; Zonghao Gu; Edward Rothberg; Roland Wunderling (System Modelling and Optimization, 1999)

Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances. - Karen I. Aardal; Robert E. Bixby; Cor A. J. Hurkens; Arjen K. Lenstra; Job W. Smeltink (IPCO, 1999)

Computational experience with parallel mixed integerprogramming in a distributed environment. - Robert E. Bixby; William J. Cook; Alan Cox; Eva K. Lee (Ann. Oper. Res., 1999)

Cutting planes and the traveling salesman problem (abstract only). - David L. Applegate; Robert E. Bixby; Vasek Chvátal; William J. Cook (SODA, 2000)

Market Split and Basis Reduction: Towards a Solution of the Cornue'jols-Dawande Instances. - Karen I. Aardal; Robert E. Bixby; Cor A. J. Hurkens; Arjen K. Lenstra; Job W. Smeltink (INFORMS J. Comput., 2000)

Parallelizing the Dual Simplex Method. - Robert E. Bixby; Alexander Martin 001 (INFORMS J. Comput., 2000)

TSP Cuts Which Do Not Conform to the Template Paradigm. - David L. Applegate; Robert E. Bixby; Vasek Chvátal; William J. Cook (Computational Combinatorial Optimization, 2001)

Solving Real-World Linear Programs: A Decade and More of Progress. - Robert E. Bixby (Oper. Res., 2002)

Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems. - David L. Applegate; Robert E. Bixby; Vasek Chvátal; William J. Cook (Math. Program., 2003)

Mixed-Integer Programming: A Progress Report. - Robert E. Bixby; Mary Fenelon; Zonghao Gu; Edward Rothberg; Roland Wunderling (The Sharpest Cut, 2004)

Progress in computational mixed integer programming - A look back from the other side of the tipping point. - Robert E. Bixby; Edward Rothberg (Ann. Oper. Res., 2007)

Technology that upsets the social order - a paradigm shift in assigning lots to tools in a wafer fabricator - the transition from rules to optimization. - Ken Fordyce; Robert E. Bixby; Richard Burda (WSC, 2008)

Certification of an optimal TSP tour through 85, 900 cities. - David L. Applegate; Robert E. Bixby; Vasek Chvátal; William J. Cook; Daniel G. Espinoza; Marcos Goycoolea; Keld Helsgaun (Oper. Res. Lett., 2009)

MIPLIB 2010. - Thorsten Koch; Tobias Achterberg; Erling Andersen; Oliver Bastert; Timo Berthold; Robert E. Bixby; Emilie Danna; Gerald Gamrath; Ambros M. Gleixner; Stefan Heinz 001; Andrea Lodi 001; Hans D. Mittelmann; et al. (Math. Program. Comput., 2011)

Presolve Reductions in Mixed Integer Programming. - Tobias Achterberg; Robert E. Bixby; Zonghao Gu; Edward Rothberg; Dieter Weninger (INFORMS J. Comput., 2020)