Robert E. Bixby

From MaRDI portal
Person:1002075

Available identifiers

zbMath Open bixby.robert-eWikidataQ7342120 ScholiaQ7342120MaRDI QIDQ1002075

List of research outcomes

PublicationDate of PublicationType
Presolve Reductions in Mixed Integer Programming2021-01-07Paper
A brief history of linear and mixed-integer programming computation2013-04-17Paper
Progress in computational mixed integer programming -- a look back from the other side of the tipping point2011-05-20Paper
Solving Real-World Linear Programs: A Decade and More of Progress2009-07-03Paper
Certification of an optimal TSP tour through 85,900 cities2009-02-23Paper
https://portal.mardi4nfdi.de/entity/Q34251322007-03-05Paper
https://portal.mardi4nfdi.de/entity/Q54651232005-08-22Paper
https://portal.mardi4nfdi.de/entity/Q47359412004-08-09Paper
Parallelizing the Dual Simplex Method2003-11-06Paper
Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances2003-10-28Paper
Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems2003-09-01Paper
Solving a Truck Dispatching Scheduling Problem Using Branch-and-Cut2002-07-01Paper
https://portal.mardi4nfdi.de/entity/Q27128222002-06-16Paper
Computational experience with parallel mixed integer programming in a distributed environment1999-12-02Paper
https://portal.mardi4nfdi.de/entity/Q42636981999-09-22Paper
On the solution of traveling salesman problems1998-08-06Paper
https://portal.mardi4nfdi.de/entity/Q48717591996-04-08Paper
Recovering an optimal LP basis from an interior point solution1995-01-11Paper
Commentary—Progress in Linear Programming1994-05-10Paper
Implementing the Simplex Method: The Initial Basis1993-04-01Paper
Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods1993-01-05Paper
A short proof of the Truemper-Tseng theorem on max-flow min-cut matroids1989-01-01Paper
Adjoints of binary matroids1988-01-01Paper
Finding Embedded Network Rows in Linear Programs I. Extraction Heuristics1988-01-01Paper
An Almost Linear-Time Algorithm for Graph Realization1988-01-01Paper
A note on detecting simple redundancies in linear systems1987-01-01Paper
Finding a small 3-connected minor maintaining a fixed minor and a fixed element1987-01-01Paper
Short cocircuits in binary matroids1987-01-01Paper
Packing and covering with integral feasible flows in integral supply-demand networks1987-01-01Paper
On chains of 3-connected matroids1986-01-01Paper
The Partial Order of a Polymatroid Extreme Point1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32222231984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33309881984-01-01Paper
A simple theorem on 3-connectivity1982-01-01Paper
Converting Linear Programs to Network Problems1980-01-01Paper
On Reid's characterization of the ternary matroids1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39090661979-01-01Paper
The solution to a matroid problem of Knuth1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41920991978-01-01Paper
Kuratowski's and Wagner's theorems for matroids1977-01-01Paper
A simple proof that every matroid is an intersection of fundamental transversal matroids1977-01-01Paper
A strengthened form of Tutte's characterization of regular matroids1976-01-01Paper
Pareto Surfaces of Complexity 11976-01-01Paper
A composition for matroids1975-01-01Paper
The Minimum Number of Edges and Vertices in a Graph with Edge Connectivity n and m n‐Bonds1975-01-01Paper
\(l\)-matrices and a characterization of binary matroids1974-01-01Paper
The minimum number of edges and vertices in a graph with edge connectivity 𝑛 and 𝑚 𝑛-bonds1974-01-01Paper
Market representations of $n$-person games1974-01-01Paper
A characterization of polyhedral market games1973-01-01Paper
A Characterization of Pareto Surfaces1973-01-01Paper
On the length-width inequality for compound clutters1971-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Robert E. Bixby