E. Andrew Boyd

According to our database, E. Andrew Boyd authored at least 20 papers between 1990 and 2006.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2006

Efficient operation of natural gas transmission systems: A network-based heuristic for cyclic structures.

Roger Z. Ríos-Mercado, Seongbae Kim, E. Andrew Boyd

Comput. Oper. Res., 2006

2004

Contract Optimization at Texas Children's Hospital.

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

Interfaces, 2004

Towards the real time solution of strike force asset allocation problems.

Vincent Chi-Wei Li, Guy L. Curry, E. Andrew Boyd

Comput. Oper. Res., 2004

2003

Revenue Management and E-Commerce.

E. Andrew Boyd, Ioana C. Bilegan

Manag. Sci., 2003

2002

From Revenue Management Concepts to Software Systems.

Nicola Secomandi, Kirk Abbott, Tankut Atan, E. Andrew Boyd

Interfaces, 2002

A Reduction Technique for Natural Gas Transmission Network Optimization Problems.

Roger Z. Ríos-Mercado, Suming Wu, L. Ridgway Scott, E. Andrew Boyd

Ann. Oper. Res., 2002

2001

Optimizing fuel consumption on gas transmission networks: evaluation of a heuristic for cyclic systems.

Roger Z. Ríos-Mercado, Seongbae Kim, E. Andrew Boyd

Proceedings of the IEEE International Conference on Systems, 2001

1998

Cutting planes for mixed-integer knapsack polyhedra.

Xiao-Qing Yan, E. Andrew Boyd

Math. Program., 1998

An Efficient Algorithm for Solving an Air Traffic Management Model of the National Airspace System.

E. Andrew Boyd, Rusty Burlingame, Kenneth Lindsay

INFORMS J. Comput., 1998

1997

A fully polynomial epsilon approximation cutting plane algorithm for solving combinatorial linear programs containing a sufficiently large ball.

E. Andrew Boyd

Oper. Res. Lett., 1997

1996

On the Complexity of a Cutting Plane Algorithm for Solving Combinatorial Linear Programs.

E. Andrew Boyd

SIAM J. Discret. Math., 1996

1995

On the Convergence of Fenchel Cutting Planes in Mixed-Integer Programming.

E. Andrew Boyd

SIAM J. Optim., 1995

Resolving degeneracy in combinatorial linear programs: steepest edge, steepest ascent, and parametric ascent.

E. Andrew Boyd

Math. Program., 1995

1994

Fenchel Cutting Planes for Integer Programs.

E. Andrew Boyd

Oper. Res., 1994

Solving 0/1 integer programs with enumeration cutting planes.

E. Andrew Boyd

Ann. Oper. Res., 1994

1993

Generating Fenchel Cutting Planes for Knapsack Polyhedra.

E. Andrew Boyd

SIAM J. Optim., 1993

Solving integer programs with Fenchel cutting planes and preprocessing.

E. Andrew Boyd

Neural Parallel Sci. Comput., 1993

Polyhedral Results for the Precedence-Constrained Knapsack Problem.

E. Andrew Boyd

Discret. Appl. Math., 1993

1992

A pseudopolynomial network flow formulation for exact knapsack separation.

E. Andrew Boyd

Networks, 1992

1990

An algorithmic characterization of antimatroids.

E. Andrew Boyd, Ulrich Faigle

Discret. Appl. Math., 1990