E. Andrew Boyd

Roger Z. Ríos-Mercado, Seongbae Kim, E. Andrew Boyd: Efficient operation of natural gas transmission systems: A network-based heuristic for cyclic structures. Computers & OR 33: 2323-2351 (2006)

Vincent Chi-Wei Li, Guy L. Curry, E. Andrew Boyd: Towards the real time solution of strike force asset allocation problems. Computers & OR 31(2): 273-291 (2004)

Chris Born, Monica Carbajal, Pat Smith, Mark Wallace, Kirk Abbott, Surain Adyanthaya, E. Andrew Boyd, Curtis Keller, Jin Liu, Wayne New, Tom Rieger, Bert Winemiller, Ron Woestemeyer: Contract Optimization at Texas Children's Hospital. Interfaces 34(1): 51-58 (2004)

E. Andrew Boyd, Ioana C. Bilegan: Revenue Management and E-Commerce. Management Science 49(10): 1363-1386 (2003)

Roger Z. Ríos-Mercado, Suming Wu, L. Ridgway Scott, E. Andrew Boyd: A Reduction Technique for Natural Gas Transmission Network Optimization Problems. Annals OR 117(1-4): 217-234 (2002)

E. Andrew Boyd, Rusty Burlingame, Kenneth Lindsay: An Efficient Algorithm for Solving an Air Traffic Management Model of the National Airspace System. INFORMS Journal on Computing 10(4): 417-426 (1998)

Xiao-Qing Yan, E. Andrew Boyd: Cutting planes for mixed-integer knapsack polyhedra. Math. Program. 81: 257-262 (1998)

Robert E. Bixby, E. Andrew Boyd, Roger Z. Ríos-Mercado (Eds.): 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

E. Andrew Boyd: On the Complexity of a Cutting Plane Algorithm for Solving Combinatorial Linear Programs. SIAM J. Discrete Math. 9(3): 365-376 (1996)

E. Andrew Boyd: Resolving degeneracy in combinatorial linear programs: steepest edge, steepest ascent, and parametric ascent. Math. Program. 68: 155-168 (1995)

E. Andrew Boyd: Polyhedral Results for the Precedence-Constrained Knapsack Problem. Discrete Applied Mathematics 41(3): 185-201 (1993)

E. Andrew Boyd: Solving integer programs with Fenchel cutting planes and preprocessing. Neural Parallel & Scientific Comp. 1: 453-466 (1993)

E. Andrew Boyd: Solving integer programs with Fenchel cutting planes and preprocessing. IPCO 1993: 209-220

E. Andrew Boyd: A pseudopolynomial network flow formulation for exact knapsack separation. Networks 22(5): 503-514 (1992)

E. Andrew Boyd, Ulrich Faigle: An algorithmic characterization of antimatroids. Discrete Applied Mathematics 28(3): 197-205 (1990)

E. Andrew Boyd: Polyhedral Results for the Precedence-Constrained Knapsack Problem. IPCO 1990: 85-100