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:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on viaf.org
-
on id.loc.gov
-
on d-nb.info
-
on 65.54.113.26
On csauthors.net:
Bibliography
2020
2011
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
2003
Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems.
Math. Program., 2003
2002
2001
Proceedings of the Computational Combinatorial Optimization, 2001
2000
Market Split and Basis Reduction: Towards a Solution of the Cornue'jols-Dawande Instances.
INFORMS J. Comput., 2000
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
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
Oper. Res. Lett., 1994
Int. J. High Perform. Comput. Appl., 1994
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
1988
1987
Packing and covering with integral feasible flows in integral supply-demand networks.
Math. Program., 1987
Comb., 1987
1986
1985
1980
1979
1978
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