default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRobert E. Bixby
Person information
- affiliation: Rice University, Houston, TX, USA
- award (2007): Frederick W. Lanchester Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j29]Tobias Achterberg
, Robert E. Bixby, Zonghao Gu, Edward Rothberg, Dieter Weninger:
Presolve Reductions in Mixed Integer Programming. INFORMS J. Comput. 32(2): 473-506 (2020)
2010 – 2019
- 2011
- [j28]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:
MIPLIB 2010. Math. Program. Comput. 3(2): 103-163 (2011)
2000 – 2009
- 2009
- [j27]David L. Applegate, Robert E. Bixby, Vasek Chvátal, William J. Cook, Daniel G. Espinoza, Marcos Goycoolea, Keld Helsgaun:
Certification of an optimal TSP tour through 85, 900 cities. Oper. Res. Lett. 37(1): 11-15 (2009) - 2008
- [c6]Ken Fordyce, Robert E. Bixby, Richard Burda:
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 2008: 2277-2285 - 2007
- [j26]Robert E. Bixby, Edward Rothberg:
Progress in computational mixed integer programming - A look back from the other side of the tipping point. Ann. Oper. Res. 149(1): 37-41 (2007) - 2004
- [p2]Robert E. Bixby, Mary Fenelon, Zonghao Gu, Edward Rothberg, Roland Wunderling:
Mixed-Integer Programming: A Progress Report. The Sharpest Cut 2004: 309-325 - 2003
- [j25]David L. Applegate, Robert E. Bixby, Vasek Chvátal, William J. Cook:
Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems. Math. Program. 97(1-2): 91-153 (2003) - 2002
- [j24]Robert E. Bixby:
Solving Real-World Linear Programs: A Decade and More of Progress. Oper. Res. 50(1): 3-15 (2002) - 2001
- [c5]David L. Applegate, Robert E. Bixby, Vasek Chvátal, William J. Cook:
TSP Cuts Which Do Not Conform to the Template Paradigm. Computational Combinatorial Optimization 2001: 261-304 - 2000
- [j23]Robert E. Bixby, Alexander Martin:
Parallelizing the Dual Simplex Method. INFORMS J. Comput. 12(1): 45-56 (2000) - [j22]Karen I. Aardal, Robert E. Bixby, Cor A. J. Hurkens, Arjen K. Lenstra, Job W. Smeltink:
Market Split and Basis Reduction: Towards a Solution of the Cornue'jols-Dawande Instances. INFORMS J. Comput. 12(3): 192-202 (2000) - [c4]David L. Applegate, Robert E. Bixby, Vasek Chvátal, William J. Cook:
Cutting planes and the traveling salesman problem (abstract only). SODA 2000: 429
1990 – 1999
- 1999
- [j21]Robert E. Bixby, William J. Cook, Alan Cox, Eva K. Lee:
Computational experience with parallel mixed integerprogramming in a distributed environment. Ann. Oper. Res. 90: 19-43 (1999) - [c3]Robert E. Bixby, Mary Fenelon, Zonghao Gu, Edward Rothberg, Roland Wunderling:
MIP: Theory and Practice - Closing the Gap. System Modelling and Optimization 1999: 19-50 - [c2]Karen I. Aardal, Robert E. Bixby, Cor A. J. Hurkens, Arjen K. Lenstra, Job W. Smeltink:
Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances. IPCO 1999: 1-16 - 1998
- [j20]Robert E. Bixby, Eva K. Lee:
Solving a Truck Dispatching Scheduling Problem Using Branch-and-Cut. Oper. Res. 46(3): 355-367 (1998) - [e1]Robert E. Bixby, E. Andrew Boyd, Roger Z. Ríos-Mercado:
Integer Programming and Combinatorial Optimization, 6th International IPCO Conference, Houston, Texas, USA, June 22-24, 1998, Proceedings. Lecture Notes in Computer Science 1412, Springer 1998, ISBN 3-540-64590-X [contents] - 1996
- [p1]Robert E. Bixby, John M. Dennis, Zhijun Wu:
Solving Nonlinear Integer Programs with a Subgradient Approach on Parallel Computers. Applications on Advanced Architecture Computers 1996: 277-286 - 1994
- [j19]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:
Numerical Optimization At the Center for Research On Parallel Computation. Int. J. High Perform. Comput. Appl. 8(2): 143-153 (1994) - [j18]Robert E. Bixby:
Commentary - Progress in Linear Programming. INFORMS J. Comput. 6(1): 15-22 (1994) - [j17]Robert E. Bixby, Matthew J. Saltzman:
Recovering an optimal LP basis from an interior point solution. Oper. Res. Lett. 15(4): 169-178 (1994) - [c1]Robert E. Bixby, Ken Kennedy, Ulrich Kremer:
Automatic Data Layout Using 0-1 Integer Programming. IFIP PACT 1994: 111-122 - 1992
- [j16]Robert E. Bixby:
Implementing the Simplex Method: The Initial Basis. INFORMS J. Comput. 4(3): 267-284 (1992) - [j15]Robert E. Bixby, John W. Gregory, Irvin J. Lustig, Roy E. Marsten, David F. Shanno:
Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods. Oper. Res. 40(5): 885-897 (1992)
1980 – 1989
- 1988
- [j14]Robert E. Bixby, Collette R. Coullard:
Adjoints of Binary Matroids. Eur. J. Comb. 9(2): 139-147 (1988) - [j13]Robert E. Bixby, Donald K. Wagner:
An Almost Linear-Time Algorithm for Graph Realization. Math. Oper. Res. 13(1): 99-123 (1988) - 1987
- [j12]Robert E. Bixby, Collette R. Coullard:
Finding a small 3-connected minor maintaining a fixed minor and a fixed element. Comb. 7(3): 231-242 (1987) - [j11]Robert E. Bixby, William H. Cunningham:
Short Cocircuits in Binary Matroids. Eur. J. Comb. 8(3): 213-225 (1987) - [j10]Robert E. Bixby, Odile M.-C. Marcotte, Leslie E. Trotter Jr.:
Packing and covering with integral feasible flows in integral supply-demand networks. Math. Program. 39(3): 231-239 (1987) - 1986
- [j9]Robert E. Bixby, Collette R. Coullard:
On chains of 3-connected matroids. Discret. Appl. Math. 15(2-3): 155-166 (1986) - 1985
- [j8]Robert E. Bixby, William H. Cunningham, Donald M. Topkis:
The Partial Order of a Polymatroid Extreme Point. Math. Oper. Res. 10(3): 367-378 (1985) - 1980
- [j7]Robert E. Bixby, William H. Cunningham:
Converting Linear Programs to Network Problems. Math. Oper. Res. 5(3): 321-357 (1980)
1970 – 1979
- 1979
- [j6]Robert E. Bixby:
On Reid's characterization of the ternary matroids. J. Comb. Theory B 26(2): 174-204 (1979) - 1978
- [j5]Robert E. Bixby:
The solution to a matroid problem of Knuth. Discret. Math. 21(1): 87-88 (1978) - 1977
- [j4]Robert E. Bixby:
A simple proof that every matroid is an intersection of fundamental transversal matroids. Discret. Math. 18(3): 311-312 (1977) - [j3]Robert E. Bixby:
Kuratowski's and Wagner's theorems for matroids. J. Comb. Theory B 22(1): 31-53 (1977) - 1975
- [j2]Robert E. Bixby:
The Minimum Number of Edges and Vertices in a Graph with Edge Connectivity n and m n-Bonds. Networks 5(3): 253-298 (1975) - 1974
- [j1]Robert E. Bixby:
ℓ-matrices and a characterization of binary matroids. Discret. Math. 8(2): 139-145 (1974)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
