The following pages link to Robert E. Bixby (Q1002075):
Displaying 50 items.
- (Q537578) (redirect page) (← links)
- Progress in computational mixed integer programming -- a look back from the other side of the tipping point (Q537580) (← links)
- (Q579123) (redirect page) (← links)
- A note on detecting simple redundancies in linear systems (Q579125) (← links)
- Certification of an optimal TSP tour through 85,900 cities (Q1002076) (← links)
- On chains of 3-connected matroids (Q1086571) (← links)
- Finding a small 3-connected minor maintaining a fixed minor and a fixed element (Q1100209) (← links)
- Short cocircuits in binary matroids (Q1101114) (← links)
- Adjoints of binary matroids (Q1109040) (← links)
- A short proof of the Truemper-Tseng theorem on max-flow min-cut matroids (Q1124594) (← links)
- On the solution of traveling salesman problems (Q1126862) (← links)
- A simple theorem on 3-connectivity (Q1171574) (← links)
- A composition for matroids (Q1219292) (← links)
- A strengthened form of Tutte's characterization of regular matroids (Q1229216) (← links)
- Kuratowski's and Wagner's theorems for matroids (Q1232413) (← links)
- On the length-width inequality for compound clutters (Q1239738) (← links)
- A simple proof that every matroid is an intersection of fundamental transversal matroids (Q1242925) (← links)
- The solution to a matroid problem of Knuth (Q1245226) (← links)
- On Reid's characterization of the ternary matroids (Q1257020) (← links)
- Recovering an optimal LP basis from an interior point solution (Q1342078) (← links)
- \(l\)-matrices and a characterization of binary matroids (Q1394232) (← links)
- Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems (Q1403285) (← links)
- Computational experience with parallel mixed integer programming in a distributed environment (Q1808186) (← links)
- A characterization of polyhedral market games (Q1843383) (← links)
- A brief history of linear and mixed-integer programming computation (Q1946013) (← links)
- (Q2712822) (← links)
- Solving a Truck Dispatching Scheduling Problem Using Branch-and-Cut (Q2781096) (← links)
- (Q3222223) (← links)
- (Q3330988) (← links)
- Presolve Reductions in Mixed Integer Programming (Q3386778) (← links)
- (Q3425132) (← links)
- Solving Real-World Linear Programs: A Decade and More of Progress (Q3635048) (← links)
- The Partial Order of a Polymatroid Extreme Point (Q3696865) (← links)
- Finding Embedded Network Rows in Linear Programs I. Extraction Heuristics (Q3780758) (← links)
- Packing and covering with integral feasible flows in integral supply-demand networks (Q3790920) (← links)
- An Almost Linear-Time Algorithm for Graph Realization (Q3800056) (← links)
- Converting Linear Programs to Network Problems (Q3885552) (← links)
- (Q3909066) (← links)
- Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods (Q4015480) (← links)
- Implementing the Simplex Method: The Initial Basis (Q4030926) (← links)
- The Minimum Number of Edges and Vertices in a Graph with Edge Connectivity n and m n‐Bonds (Q4073398) (← links)
- Pareto Surfaces of Complexity 1 (Q4086939) (← links)
- (Q4192099) (← links)
- (Q4263698) (← links)
- Commentary—Progress in Linear Programming (Q4291493) (← links)
- Parallelizing the Dual Simplex Method (Q4427319) (← links)
- Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances (Q4427331) (← links)
- (Q4735941) (← links)
- The minimum number of edges and vertices in a graph with edge connectivity 𝑛 and 𝑚 𝑛-bonds (Q4773729) (← links)
- Market representations of $n$-person games (Q4777099) (← links)
