Robert E. Bixby

Affiliations:
  • Rice University, Houston, TX, USA


According to our database1, Robert E. Bixby authored at least 37 papers between 1974 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Presolve Reductions in Mixed Integer Programming.
INFORMS J. Comput., 2020

2011
MIPLIB 2010.
Math. Program. Comput., 2011

2009
Certification of an optimal TSP tour through 85, 900 cities.
Oper. Res. Lett., 2009

2008
Technology that upsets the social order - a paradigm shift in assigning lots to tools in a wafer fabricator - the transition from rules to optimization.
Proceedings of the 2008 Winter Simulation Conference, Global Gateway to Discovery, 2008

2007
Progress in computational mixed integer programming - A look back from the other side of the tipping point.
Ann. Oper. Res., 2007

2004
Mixed-Integer Programming: A Progress Report.
Proceedings of the Sharpest Cut, 2004

2003
Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems.
Math. Program., 2003

2002
Solving Real-World Linear Programs: A Decade and More of Progress.
Oper. Res., 2002

2001
TSP Cuts Which Do Not Conform to the Template Paradigm.
Proceedings of the Computational Combinatorial Optimization, 2001

2000
Parallelizing the Dual Simplex Method.
INFORMS J. Comput., 2000

Market Split and Basis Reduction: Towards a Solution of the Cornue'jols-Dawande Instances.
INFORMS J. Comput., 2000

Cutting planes and the traveling salesman problem (abstract only).
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

1999
Computational experience with parallel mixed integerprogramming in a distributed environment.
Ann. Oper. Res., 1999

Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances.
Proceedings of the Integer Programming and Combinatorial Optimization, 1999

MIP: Theory and Practice - Closing the Gap.
Proceedings of the System Modelling and Optimization: Methods, 1999

1998
Solving a Truck Dispatching Scheduling Problem Using Branch-and-Cut.
Oper. Res., 1998

1996
Solving Nonlinear Integer Programs with a Subgradient Approach on Parallel Computers.
Proceedings of the Applications on Advanced Architecture Computers, 1996

1994
Recovering an optimal LP basis from an interior point solution.
Oper. Res. Lett., 1994

Commentary - Progress in Linear Programming.
INFORMS J. Comput., 1994

Numerical Optimization At the Center for Research On Parallel Computation.
Int. J. High Perform. Comput. Appl., 1994

Automatic Data Layout Using 0-1 Integer Programming.
Proceedings of the Parallel Architectures and Compilation Techniques, 1994

1992
Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods.
Oper. Res., 1992

Implementing the Simplex Method: The Initial Basis.
INFORMS J. Comput., 1992

1988
An Almost Linear-Time Algorithm for Graph Realization.
Math. Oper. Res., 1988

Adjoints of Binary Matroids.
Eur. J. Comb., 1988

1987
Packing and covering with integral feasible flows in integral supply-demand networks.
Math. Program., 1987

Short Cocircuits in Binary Matroids.
Eur. J. Comb., 1987

Finding a small 3-connected minor maintaining a fixed minor and a fixed element.
Comb., 1987

1986
On chains of 3-connected matroids.
Discret. Appl. Math., 1986

1985
The Partial Order of a Polymatroid Extreme Point.
Math. Oper. Res., 1985

1980
Converting Linear Programs to Network Problems.
Math. Oper. Res., 1980

1979
On Reid's characterization of the ternary matroids.
J. Comb. Theory, Ser. B, 1979

1978
The solution to a matroid problem of Knuth.
Discret. Math., 1978

1977
Kuratowski's and Wagner's theorems for matroids.
J. Comb. Theory, Ser. B, 1977

A simple proof that every matroid is an intersection of fundamental transversal matroids.
Discret. Math., 1977

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

1974
ℓ-matrices and a characterization of binary matroids.
Discret. Math., 1974


  Loading...