Robert E. Bixby
-
- Vehicle Routing Optimization Methods 6
- Optimization and Packing Problems 6
- Numerical Analysis top 2%
- Advanced Optimization Algorithms Research 8
- Computational Theory and Mathematics top 0.5%
- Advanced Graph Theory Research 18
- Complexity and Algorithms in Graphs 11
- Advanced Algebra and Logic 5
-
- Optimization and Search Problems 8
-
- Scheduling and Timetabling Solutions 5
- Co-authors
- Vašek ChvátalDavid ApplegateWilliam J. CookEdward RothbergWilliam H. CunninghamLouis J. BilleraMartin SavelsberghTobias Achterberg
- Cited by
- Industrial and Manufacturing EngineeringNumerical AnalysisComputational Theory and Mathematics
- Journals
- Journal of Combinatorial Theory Series B (5 papers)INFORMS journal on computing (3 papers)Operations Research (3 papers)
- Partner nations
- United StatesCanadaGermany
In The Last Decade
Robert E. Bixby
54 papers receiving 2.4k citations
Peers
Comparison fields: 5 of 127
- Industrial and Manufacturing Engineering 875
- Numerical Analysis 370
- Computational Theory and Mathematics 980
- Computer Networks and Communications 563
- Management Science and Operations Research 285
Countries citing papers authored by Robert E. Bixby
This map shows the geographic impact of Robert E. Bixby's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Robert E. Bixby with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Robert E. Bixby more than expected).
Fields of papers citing papers by Robert E. Bixby
This network shows the impact of papers produced by Robert E. Bixby. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Robert E. Bixby. The network helps show where Robert E. Bixby may publish in the future.
Co-authorship network
The 25 scholars most cited alongside Robert E. Bixby, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2011 | 208 | |
| 2 | 2011 | 209 | |
| 3 | The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics) | 2007 | 284 |
| 4 | 2006 | 48 | |
| 5 | 2005 | 1 | |
| 6 | 2002 | 211 | |
| 7 | 2000 | 1 | |
| 8 | Finding Tours in the TSP | 1999 | 40 |
| 9 | Automatic Data Layout Using 0-1 Integer Programming | 1994 | 60 |
| 10 | 1987 | 11 | |
| 11 | 1986 | 7 | |
| 12 | 1982 | 71 | |
| 13 | 1979 | 49 | |
| 14 | 1978 | 2 | |
| 15 | 1977 | 13 | |
| 16 | 1975 | 29 | |
| 17 | 1974 | 30 | |
| 18 | 1974 | 7 | |
| 19 | 1973 | 4 | |
| 20 | 1971 | 3 |
About Robert E. Bixby
Robert E. Bixby is a scholar working on Computational Theory and Mathematics, Numerical Analysis, Industrial and Manufacturing Engineering, Computer Networks and Communications and Hardware and Architecture, having authored 56 papers that have together received 2.6k indexed citations. Recurring topics across this work include Advanced Graph Theory Research (18 papers), Complexity and Algorithms in Graphs (11 papers), Optimization and Search Problems (8 papers), Advanced Optimization Algorithms Research (8 papers), Vehicle Routing Optimization Methods (6 papers), Optimization and Packing Problems (6 papers), Scheduling and Timetabling Solutions (5 papers) and Advanced Algebra and Logic (5 papers). The work is most often cited by research in Industrial and Manufacturing Engineering (875 citations), Numerical Analysis (370 citations), Computational Theory and Mathematics (980 citations), Computer Networks and Communications (563 citations) and Management Science and Operations Research (285 citations). Robert E. Bixby has collaborated with scholars based in United States, Canada and Germany. Frequent co-authors include Vašek Chvátal, David Applegate, William J. Cook, Edward Rothberg, William H. Cunningham, Louis J. Billera, Martin Savelsbergh, Tobias Achterberg, Donald K. Wagner and Bryan G. Cook. Their work appears in journals such as Journal of Combinatorial Theory Series B, INFORMS journal on computing, Operations Research, Operations Research Letters and Mathematics of Operations Research.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.