Robert E. Bixby

Publication Activity (10 Years)

Years Active: 1974-2020
Publications (10 Years): 1

Top Topics

Mixed Integer Programming

Dantzig Wolfe Decomposition

Unit Commitment

Graphical Models

Top Venues

INFORMS J. Comput.

Publications

Tobias Achterberg, Robert E. Bixby, Zonghao Gu, Edward Rothberg, Dieter Weninger
Presolve Reductions in Mixed Integer Programming. INFORMS J. Comput. 32 (2) (2020)
Thorsten Koch, Tobias Achterberg, Erling Andersen, Oliver Bastert, Timo Berthold, Robert E. Bixby, Emilie Danna, Gerald Gamrath, Ambros M. Gleixner, Stefan Heinz, Andrea Lodi, Hans D. Mittelmann, Ted K. Ralphs, Domenico Salvagnin, Daniel E. Steffy, Kati Wolter
MIPLIB 2010. Math. Program. Comput. 3 (2) (2011)
David L. 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) (2009)
Ken Fordyce, Robert E. Bixby, Richard Burda
Technology that upsets the social order - a paradigm shift in assigning lots to tools in a wafer fabricator - the transition from rules to optimization. WSC (2008)
Robert E. Bixby, Edward Rothberg
Progress in computational mixed integer programming - A look back from the other side of the tipping point. Ann. Oper. Res. 149 (1) (2007)
David L. 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) (2003)
Robert E. Bixby
Solving Real-World Linear Programs: A Decade and More of Progress. Oper. Res. 50 (1) (2002)
David L. Applegate, Robert E. Bixby, Vasek Chvátal, William J. Cook
TSP Cuts Which Do Not Conform to the Template Paradigm. Computational Combinatorial Optimization (2001)
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 J. Comput. 12 (3) (2000)
Robert E. Bixby, Alexander Martin
Parallelizing the Dual Simplex Method. INFORMS J. Comput. 12 (1) (2000)
David L. Applegate, Robert E. Bixby, Vasek Chvátal, William J. Cook
Cutting planes and the traveling salesman problem (abstract only). SODA (2000)
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)
Robert E. Bixby, William J. Cook, Alan Cox, Eva K. Lee
Computational experience with parallel mixed integerprogramming in a distributed environment. Ann. Oper. Res. 90 (1999)
Robert E. Bixby, Mary Fenelon, Zonghao Gu, Edward Rothberg, Roland Wunderling
MIP: Theory and Practice - Closing the Gap. System Modelling and Optimization (1999)
Robert E. Bixby, Eva K. Lee
Solving a Truck Dispatching Scheduling Problem Using Branch-and-Cut. Oper. Res. 46 (3) (1998)
Robert E. Bixby, Ken Kennedy, Ulrich Kremer
Automatic Data Layout Using 0-1 Integer Programming. IFIP PACT (1994)
Robert E. Bixby, Matthew J. Saltzman
Recovering an optimal LP basis from an interior point solution. Oper. Res. Lett. 15 (4) (1994)
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, Virginia Torczon, Karen Williamson
Numerical Optimization At the Center for Research On Parallel Computation. Int. J. High Perform. Comput. Appl. 8 (2) (1994)
Robert E. Bixby
Commentary - Progress in Linear Programming. INFORMS J. Comput. 6 (1) (1994)
Robert E. Bixby
Implementing the Simplex Method: The Initial Basis. INFORMS J. Comput. 4 (3) (1992)
Robert E. Bixby, John W. Gregory, Irvin J. Lustig, Roy E. Marsten, David F. Shanno
Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods. Oper. Res. 40 (5) (1992)
Robert E. Bixby, Collette R. Coullard
Adjoints of Binary Matroids. Eur. J. Comb. 9 (2) (1988)
Robert E. Bixby, Donald K. Wagner
An Almost Linear-Time Algorithm for Graph Realization. Math. Oper. Res. 13 (1) (1988)
Robert E. Bixby, Collette R. Coullard
Finding a small 3-connected minor maintaining a fixed minor and a fixed element. Comb. 7 (3) (1987)
Robert E. Bixby, William H. Cunningham
Short Cocircuits in Binary Matroids. Eur. J. Comb. 8 (3) (1987)
Robert E. Bixby, Odile M.-C. Marcotte, Leslie E. Trotter Jr.
Packing and covering with integral feasible flows in integral supply-demand networks. Math. Program. 39 (3) (1987)
Robert E. Bixby, Collette R. Coullard
On chains of 3-connected matroids. Discret. Appl. Math. 15 (2-3) (1986)
Robert E. Bixby, William H. Cunningham, Donald M. Topkis
The Partial Order of a Polymatroid Extreme Point. Math. Oper. Res. 10 (3) (1985)
Robert E. Bixby, William H. Cunningham
Converting Linear Programs to Network Problems. Math. Oper. Res. 5 (3) (1980)
Robert E. Bixby
On Reid's characterization of the ternary matroids. J. Comb. Theory, Ser. B 26 (2) (1979)
Robert E. Bixby
The solution to a matroid problem of Knuth. Discret. Math. 21 (1) (1978)
Robert E. Bixby
A simple proof that every matroid is an intersection of fundamental transversal matroids. Discret. Math. 18 (3) (1977)
Robert E. Bixby
Kuratowski's and Wagner's theorems for matroids. J. Comb. Theory, Ser. B 22 (1) (1977)
Robert E. Bixby
The Minimum Number of Edges and Vertices in a Graph with Edge Connectivity n and m n-Bonds. Networks 5 (3) (1975)
Robert E. Bixby
ℓ-matrices and a characterization of binary matroids. Discret. Math. 8 (2) (1974)