Robert E. Bixby

38 papers A* 1B 2Misc 1Journal 29Unranked 3

Year	Rank	Type	Title / Venue / Authors
2020	J	`jnl`	Presolve Reductions in Mixed Integer Programming. INFORMS J. Comput. Tobias Achterberg, Robert E. Bixby, Zonghao Gu, Edward Rothberg, Dieter Weninger
2011	J	`jnl`	MIPLIB 2010. Math. Program. Comput. 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
2009	J	`jnl`	Certification of an optimal TSP tour through 85, 900 cities. Oper. Res. Lett. David L. Applegate, Robert E. Bixby, Vasek Chvátal, William J. Cook, Daniel G. Espinoza, Marcos Goycoolea, Keld Helsgaun
2008	Misc	`conf`	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 Ken Fordyce, Robert E. Bixby, Richard Burda
2007	J	`jnl`	Progress in computational mixed integer programming - A look back from the other side of the tipping point. Ann. Oper. Res. Robert E. Bixby, Edward Rothberg
2004	—	`ch.`	Mixed-Integer Programming: A Progress Report. The Sharpest Cut Robert E. Bixby, Mary Fenelon, Zonghao Gu, Edward Rothberg, Roland Wunderling
2003	J	`jnl`	Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems. Math. Program. David L. Applegate, Robert E. Bixby, Vasek Chvátal, William J. Cook
2002	J	`jnl`	Solving Real-World Linear Programs: A Decade and More of Progress. Oper. Res. Robert E. Bixby
2001	—	`conf`	TSP Cuts Which Do Not Conform to the Template Paradigm. Computational Combinatorial Optimization David L. Applegate, Robert E. Bixby, Vasek Chvátal, William J. Cook
2000	A*	`conf`	Cutting planes and the traveling salesman problem (abstract only). SODA David L. Applegate, Robert E. Bixby, Vasek Chvátal, William J. Cook
2000	J	`jnl`	Market Split and Basis Reduction: Towards a Solution of the Cornue'jols-Dawande Instances. INFORMS J. Comput. Karen I. Aardal, Robert E. Bixby, Cor A. J. Hurkens, Arjen K. Lenstra, Job W. Smeltink
2000	J	`jnl`	Parallelizing the Dual Simplex Method. INFORMS J. Comput. Robert E. Bixby, Alexander Martin
1999	J	`jnl`	Computational experience with parallel mixed integerprogramming in a distributed environment. Ann. Oper. Res. Robert E. Bixby, William J. Cook, Alan Cox, Eva K. Lee
1999	—	`conf`	MIP: Theory and Practice - Closing the Gap. System Modelling and Optimization Robert E. Bixby, Mary Fenelon, Zonghao Gu, Edward Rothberg, Roland Wunderling
1999	B	`conf`	Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances. IPCO Karen I. Aardal, Robert E. Bixby, Cor A. J. Hurkens, Arjen K. Lenstra, Job W. Smeltink
1998	B	`ed.`	Integer Programming and Combinatorial Optimization, 6th International IPCO Conference, Houston, Texas, USA, June 22-24, 1998, Proceedings IPCO Robert E. Bixby, E. Andrew Boyd, Roger Z. Ríos-Mercado
1998	J	`jnl`	Solving a Truck Dispatching Scheduling Problem Using Branch-and-Cut. Oper. Res. Robert E. Bixby, Eva K. Lee
1996	—	`ch.`	Solving Nonlinear Integer Programs with a Subgradient Approach on Parallel Computers. Applications on Advanced Architecture Computers Robert E. Bixby, John M. Dennis, Zhijun Wu
1994	—	`conf`	Automatic Data Layout Using 0-1 Integer Programming. IFIP PACT Robert E. Bixby, Ken Kennedy, Ulrich Kremer
1994	J	`jnl`	Commentary - Progress in Linear Programming. INFORMS J. Comput. Robert E. Bixby
1994	J	`jnl`	Numerical Optimization At the Center for Research On Parallel Computation. Int. J. High Perform. Comput. Appl. 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
1994	J	`jnl`	Recovering an optimal LP basis from an interior point solution. Oper. Res. Lett. Robert E. Bixby, Matthew J. Saltzman
1992	J	`jnl`	Implementing the Simplex Method: The Initial Basis. INFORMS J. Comput. Robert E. Bixby
1992	J	`jnl`	Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods. Oper. Res. Robert E. Bixby, John W. Gregory, Irvin J. Lustig, Roy E. Marsten, David F. Shanno
1988	J	`jnl`	Adjoints of Binary Matroids. Eur. J. Comb. Robert E. Bixby, Collette R. Coullard
1988	J	`jnl`	An Almost Linear-Time Algorithm for Graph Realization. Math. Oper. Res. Robert E. Bixby, Donald K. Wagner
1987	J	`jnl`	Finding a small 3-connected minor maintaining a fixed minor and a fixed element. Comb. Robert E. Bixby, Collette R. Coullard
1987	J	`jnl`	Packing and covering with integral feasible flows in integral supply-demand networks. Math. Program. Robert E. Bixby, Odile M.-C. Marcotte, Leslie E. Trotter Jr.
1987	J	`jnl`	Short Cocircuits in Binary Matroids. Eur. J. Comb. Robert E. Bixby, William H. Cunningham
1986	J	`jnl`	On chains of 3-connected matroids. Discret. Appl. Math. Robert E. Bixby, Collette R. Coullard
1985	J	`jnl`	The Partial Order of a Polymatroid Extreme Point. Math. Oper. Res. Robert E. Bixby, William H. Cunningham, Donald M. Topkis
1980	J	`jnl`	Converting Linear Programs to Network Problems. Math. Oper. Res. Robert E. Bixby, William H. Cunningham
1979	J	`jnl`	On Reid's characterization of the ternary matroids. J. Comb. Theory B Robert E. Bixby
1978	J	`jnl`	The solution to a matroid problem of Knuth. Discret. Math. Robert E. Bixby
1977	J	`jnl`	A simple proof that every matroid is an intersection of fundamental transversal matroids. Discret. Math. Robert E. Bixby
1977	J	`jnl`	Kuratowski's and Wagner's theorems for matroids. J. Comb. Theory B Robert E. Bixby
1975	J	`jnl`	The Minimum Number of Edges and Vertices in a Graph with Edge Connectivity n and m n-Bonds. Networks Robert E. Bixby
1974	J	`jnl`	ℓ-matrices and a characterization of binary matroids. Discret. Math. Robert E. Bixby