World's Best Scientists 2026 revealed!
Robert E. Bixby

Robert E. Bixby

D-Index & Metrics

Engineering and Technology

D-Index
31
Citations
5609
World Ranking
9653
National Ranking
2750

Research.com Recognitions

  • 2002 - Fellow of the Institute for Operations Research and the Management Sciences (INFORMS)
  • 1997 - Member of the National Academy of Engineering For contributions to combinatorial optimization and the development and commercialization of high-performance optimization software.

Overview

Robert E. Bixby is affiliated with Rice University in the United States. Their work spans various areas within the broad scope of academic research, with frequent collaborations noted with several researchers.

Co-authors who have collaborated with Robert E. Bixby include:

  • Ingrid Daubechies
  • Jan Karel Lenstra
  • Sergey Haddad
  • Matrix Nersesov
  • Luca Zaccarian

Throughout their career, Robert E. Bixby has received notable recognition in the field of operations research and optimization. The honors include:

  • Fellow of the Institute for Operations Research and the Management Sciences (INFORMS), awarded in 2002
  • Member of the National Academy of Engineering, awarded in 1997 for contributions to combinatorial optimization and the development and commercialization of high-performance optimization software

The available data on their recent works does not list specific paper titles or publication venues. There are also no records of main fields of study, subfields, or main topics provided.

The scientist's contributions have been connected with high-performance optimization software and combinatorial optimization, reflecting a focus on improving computational tools and methodologies relevant to operations research.

Best Publications

  • The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)

    David L. Applegate;Robert E. Bixby;Vasek Chvatal;William J. Cook

  • Solving Real-World Linear Programs: A Decade and More of Progress

    Robert E. Bixby

  • MIPLIB 2010 - Mixed Integer Programming Library version 5

    Thorsten Koch;Tobias Achterberg;Erling Andersen;Oliver Bastert

  • MIP: Theory and Practice - Closing the Gap

    Robert E. Bixby;Robert E. Bixby;Mary Fenelon;Zonghao Gu;Edward Rothberg

  • Finding Cuts in the TSP (A preliminary report)

    D. Applegate;R. Bixby;V. Chvatal;B. Cook

  • Progress in computational mixed integer programming—A look back from the other side of the tipping point

    Unknown

  • Certification of an optimal TSP tour through 85,900 cities

    David L. Applegate;Robert E. Bixby;VašEk ChváTal;William Cook

  • Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems

    David L. Applegate;Robert E. Bixby;Vasek Chvátal;William J. Cook

  • Implementing the Simplex Method: The Initial Basis

    Robert E. Bixby

  • Very large-scale linear programming: a case study in combining interior point and simplex methods

    Robert E. Bixby;John W. Gregory;Irvin J. Lustig;Roy E. Marsten

  • TSP Cuts Which Do Not Conform to the Template Paradigm

    David Applegate;Robert E. Bixby;Vasek Chvátal;William Cook

  • Presolve Reductions in Mixed Integer Programming

    Tobias Achterberg;Robert E. Bixby;Zonghao Gu;Edward Rothberg

  • Mixed-Integer Programming: A Progress Report.

    Robert E. Bixby;Mary Fenelon;Zonghao Gu;Edward Rothberg

  • Automatic Data Layout Using 0-1 Integer Programming

    Robert E. Bixby;Ken Kennedy;Ulrich Kremer

  • Converting Linear Programs to Network Problems

    Unknown

  • Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances

    K. Aardal;R. E. Bixby;C. A. J. Hurkens;A. K. Lenstra

  • A simple theorem on 3-connectivity

    Unknown

  • Recovering an optimal LP basis from an interior point solution

    Robert E. Bixby;Matthew J. Saltzman

  • Commentary—Progress in Linear Programming

    Robert E. Bixby

  • On Reid's characterization of the ternary matroids

    Unknown

  • A Composition for Perfect Graphs

    Robert E. Bixby

  • A note on detecting simple redundancies in linear systems

    R. E. Bixby;D. K. Wagner

  • Mixed Integer Programming Library version 5

    Thorsten Koch;Tobias Achterberg;Erling Andersen;Oliver Bastert

  • Solving a Truck Dispatching Scheduling Problem Using Branch-And-Cut

    Robert E. Bixby;Eva K. Lee

  • Finding Embedded Network Rows in Linear Programs I. Extraction Heuristics

    Robert E. Bixby;Robert Fourer

Frequent Co-Authors

Vasek Chvátal
Vasek Chvátal Concordia University
William J. Cook
William J. Cook University of Waterloo
Andrea Lodi
Andrea Lodi Cornell University
Arjen K. Lenstra
Arjen K. Lenstra École Polytechnique Fédérale de Lausanne
Thorsten Koch
Thorsten Koch Zuse Institute Berlin
Benjamin F. Hobbs
Benjamin F. Hobbs Johns Hopkins University
Ken Kennedy
Ken Kennedy Rice University
Alan L. Cox
Alan L. Cox Rice University
Michael H. Rothkopf
Michael H. Rothkopf Pennsylvania State University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Best Scientists Citing Robert E. Bixby

Trending Scientists

Recently Published Articles