E. Andrew Boyd

Publication Activity (10 Years)

Years Active: 1990-2006
Publications (10 Years): 0

Publications

Roger Z. Ríos-Mercado, Seongbae Kim, E. Andrew Boyd
Efficient operation of natural gas transmission systems: A network-based heuristic for cyclic structures. Comput. Oper. Res. 33 (2006)
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) (2004)
Vincent Chi-Wei Li, Guy L. Curry, E. Andrew Boyd
Towards the real time solution of strike force asset allocation problems. Comput. Oper. Res. 31 (2) (2004)
E. Andrew Boyd, Ioana C. Bilegan
Revenue Management and E-Commerce. Manag. Sci. 49 (10) (2003)
Roger Z. Ríos-Mercado, Suming Wu, L. Ridgway Scott, E. Andrew Boyd
A Reduction Technique for Natural Gas Transmission Network Optimization Problems. Ann. Oper. Res. 117 (1-4) (2002)
Nicola Secomandi, Kirk Abbott, Tankut Atan, E. Andrew Boyd
From Revenue Management Concepts to Software Systems. Interfaces 32 (2) (2002)
Roger Z. Ríos-Mercado, Seongbae Kim, E. Andrew Boyd
Optimizing fuel consumption on gas transmission networks: evaluation of a heuristic for cyclic systems. SMC (2001)
Xiao-Qing Yan, E. Andrew Boyd
Cutting planes for mixed-integer knapsack polyhedra. Math. Program. 81 (1998)
E. Andrew Boyd, Rusty Burlingame, Kenneth Lindsay
An Efficient Algorithm for Solving an Air Traffic Management Model of the National Airspace System. INFORMS J. Comput. 10 (4) (1998)
E. Andrew Boyd
A fully polynomial epsilon approximation cutting plane algorithm for solving combinatorial linear programs containing a sufficiently large ball. Oper. Res. Lett. 20 (2) (1997)
E. Andrew Boyd
On the Complexity of a Cutting Plane Algorithm for Solving Combinatorial Linear Programs. SIAM J. Discret. Math. 9 (3) (1996)
E. Andrew Boyd
On the Convergence of Fenchel Cutting Planes in Mixed-Integer Programming. SIAM J. Optim. 5 (2) (1995)
E. Andrew Boyd
Resolving degeneracy in combinatorial linear programs: steepest edge, steepest ascent, and parametric ascent. Math. Program. 68 (1995)
E. Andrew Boyd
Fenchel Cutting Planes for Integer Programs. Oper. Res. 42 (1) (1994)
E. Andrew Boyd
Solving 0/1 integer programs with enumeration cutting planes. Ann. Oper. Res. 50 (1) (1994)
E. Andrew Boyd
Generating Fenchel Cutting Planes for Knapsack Polyhedra. SIAM J. Optim. 3 (4) (1993)
E. Andrew Boyd
Solving integer programs with Fenchel cutting planes and preprocessing. Neural Parallel Sci. Comput. 1 (1993)
E. Andrew Boyd
Polyhedral Results for the Precedence-Constrained Knapsack Problem. Discret. Appl. Math. 41 (3) (1993)
E. Andrew Boyd
Solving integer programs with Fenchel cutting planes and preprocessing. IPCO (1993)
E. Andrew Boyd
A pseudopolynomial network flow formulation for exact knapsack separation. Networks 22 (5) (1992)
E. Andrew Boyd
Polyhedral Results for the Precedence-Constrained Knapsack Problem. IPCO (1990)
E. Andrew Boyd, Ulrich Faigle
An algorithmic characterization of antimatroids. Discret. Appl. Math. 28 (3) (1990)