E. Andrew Boyd

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2006
Efficient operation of natural gas transmission systems: A network-based heuristic for cyclic structures.
Comput. Oper. Res., 2006

2004
Contract Optimization at Texas Children's Hospital.
Interfaces, 2004

Towards the real time solution of strike force asset allocation problems.
Comput. Oper. Res., 2004

2003
Revenue Management and E-Commerce.
Manag. Sci., 2003

2002
From Revenue Management Concepts to Software Systems.
Interfaces, 2002

A Reduction Technique for Natural Gas Transmission Network Optimization Problems.
Ann. Oper. Res., 2002

2001
Optimizing fuel consumption on gas transmission networks: evaluation of a heuristic for cyclic systems.
Proceedings of the IEEE International Conference on Systems, 2001

1998
Cutting planes for mixed-integer knapsack polyhedra.
Math. Program., 1998

An Efficient Algorithm for Solving an Air Traffic Management Model of the National Airspace System.
INFORMS J. Comput., 1998

1997
A fully polynomial epsilon approximation cutting plane algorithm for solving combinatorial linear programs containing a sufficiently large ball.
Oper. Res. Lett., 1997

1996
On the Complexity of a Cutting Plane Algorithm for Solving Combinatorial Linear Programs.
SIAM J. Discret. Math., 1996

1995
On the Convergence of Fenchel Cutting Planes in Mixed-Integer Programming.
SIAM J. Optim., 1995

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

1994
Fenchel Cutting Planes for Integer Programs.
Oper. Res., 1994

Solving 0/1 integer programs with enumeration cutting planes.
Ann. Oper. Res., 1994

1993
Generating Fenchel Cutting Planes for Knapsack Polyhedra.
SIAM J. Optim., 1993

Solving integer programs with Fenchel cutting planes and preprocessing.
Neural Parallel & Scientific Comp., 1993

Polyhedral Results for the Precedence-Constrained Knapsack Problem.
Discret. Appl. Math., 1993

1992
A pseudopolynomial network flow formulation for exact knapsack separation.
Networks, 1992

1990
An algorithmic characterization of antimatroids.
Discret. Appl. Math., 1990


  Loading...