Search the dblp DataBase

Publications of Author

1. E. Andrew Boyd
   Polyhedral Results for the Precedence-Constrained Knapsack Problem. [Citation Graph (0, 0)][DBLP]
   IPCO, 1990, pp:85-100 [Conf]
   
2. E. Andrew Boyd
   Solving integer programs with Fenchel cutting planes and preprocessing. [Citation Graph (0, 0)][DBLP]
   IPCO, 1993, pp:209-220 [Conf]
   
3. Vincent Chi-Wei Li, Guy L. Curry, E. Andrew Boyd
   Towards the real time solution of strike force asset allocation problems. [Citation Graph (0, 0)][DBLP]
   Computers & OR, 2004, v:31, n:2, pp:273-291 [Journal]
   
4. Roger Z. Ríos-Mercado, Seongbae Kim, E. Andrew Boyd
   Efficient operation of natural gas transmission systems: A network-based heuristic for cyclic structures. [Citation Graph (0, 0)][DBLP]
   Computers & OR, 2006, v:33, n:, pp:2323-2351 [Journal]
   
5. E. Andrew Boyd
   Polyhedral Results for the Precedence-Constrained Knapsack Problem. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1993, v:41, n:3, pp:185-201 [Journal]
   
6. E. Andrew Boyd
   Resolving degeneracy in combinatorial linear programs: steepest edge, steepest ascent, and parametric ascent. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1995, v:68, n:, pp:155-168 [Journal]
   
7. Xiao-Qing Yan, E. Andrew Boyd
   Cutting planes for mixed-integer knapsack polyhedra. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1998, v:81, n:, pp:257-262 [Journal]
   
8. E. Andrew Boyd
   On the Complexity of a Cutting Plane Algorithm for Solving Combinatorial Linear Programs. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 1996, v:9, n:3, pp:365-376 [Journal]
   
9. 
   An algorithmic characterization of antimatroids. [Citation Graph (, )][DBLP]