E. Andrew Boyd

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