 | 2009 |
| 17 |  | David Applegate,
Robert E. Bixby,
Vasek Chvátal,
William J. Cook,
Daniel G. Espinoza,
Marcos Goycoolea,
Keld Helsgaun:
Certification of an optimal TSP tour through 85, 900 cities.
Oper. Res. Lett. 37(1): 11-15 (2009) |
| 2007 |
| 16 |  | Robert E. Bixby,
Edward Rothberg:
Progress in computational mixed integer programming - A look back from the other side of the tipping point.
Annals OR 149(1): 37-41 (2007) |
| 2003 |
| 15 |  | David Applegate,
Robert E. Bixby,
Vasek Chvátal,
William J. Cook:
Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems.
Math. Program. 97(1-2): 91-153 (2003) |
| 2002 |
| 14 |  | Robert E. Bixby:
Solving Real-World Linear Programs: A Decade and More of Progress.
Operations Research 50(1): 3-15 (2002) |
| 2001 |
| 13 |  | David Applegate,
Robert E. Bixby,
Vasek Chvátal,
William J. Cook:
TSP Cuts Which Do Not Conform to the Template Paradigm.
Computational Combinatorial Optimization 2001: 261-304 |
| 2000 |
| 12 |  | David Applegate,
Robert E. Bixby,
Vasek Chvátal,
William J. Cook:
Cutting planes and the traveling salesman problem (abstract only).
SODA 2000: 429 |
| 11 |  | Robert E. Bixby,
Alexander Martin:
Parallelizing the Dual Simplex Method.
INFORMS Journal on Computing 12(1): 45-56 (2000) |
| 10 |  | Karen Aardal,
Robert E. Bixby,
Cor A. J. Hurkens,
Arjen K. Lenstra,
Job W. Smeltink:
Market Split and Basis Reduction: Towards a Solution of the Cornue'jols-Dawande Instances.
INFORMS Journal on Computing 12(3): 192-202 (2000) |
| 1999 |
| 9 |  | Karen Aardal,
Robert E. Bixby,
Cor A. J. Hurkens,
Arjen K. Lenstra,
Job W. Smeltink:
Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances.
IPCO 1999: 1-16 |
| 8 |  | Robert E. Bixby,
Mary Fenelon,
Zonghao Gu,
Edward Rothberg,
Roland Wunderling:
MIP: Theory and Practice - Closing the Gap.
System Modelling and Optimization 1999: 19-50 |
| 1998 |
| 7 |  | Robert E. Bixby,
E. Andrew Boyd,
Roger Z. Ríos-Mercado:
Integer Programming and Combinatorial Optimization, 6th International IPCO Conference, Houston, Texas, USA, June 22-24, 1998, Proceedings
Springer 1998 |
| 1994 |
| 6 |  | Robert E. Bixby,
Ken Kennedy,
Ulrich Kremer:
Automatic Data Layout Using 0-1 Integer Programming.
IFIP PACT 1994: 111-122 |
| 5 |  | Robert E. Bixby:
Commentary - Progress in Linear Programming.
INFORMS Journal on Computing 6(1): 15-22 (1994) |
| 1992 |
| 4 |  | Robert E. Bixby:
Implementing the Simplex Method: The Initial Basis.
INFORMS Journal on Computing 4(3): 267-284 (1992) |
| 1987 |
| 3 |  | Robert E. Bixby,
Collette R. Coullard:
Finding a small 3-connected minor maintaining a fixed minor and a fixed element.
Combinatorica 7(3): 231-242 (1987) |
| 1979 |
| 2 |  | Robert E. Bixby:
On Reid's characterization of the ternary matroids.
J. Comb. Theory, Ser. B 26(2): 174-204 (1979) |
| 1977 |
| 1 |  | Robert E. Bixby:
Kuratowski's and Wagner's theorems for matroids.
J. Comb. Theory, Ser. B 22(1): 31-53 (1977) |