E. Andrew Boyd - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 22 from 22

2006

Efficient operation of natural gas transmission systems: A network-based heuristic for cyclic structuresRoger Z. Ríos-Mercado, Seongbae Kim, E. Andrew Boyd. cor, 33:2323-2351, 2006. [doi]

2004

2003

Revenue Management and E-CommerceE. Andrew Boyd, Ioana C. Bilegan. mansci, 49(10):1363-1386, 2003. [doi]

2002

A Reduction Technique for Natural Gas Transmission Network Optimization ProblemsRoger Z. Ríos-Mercado, Suming Wu, L. Ridgway Scott, E. Andrew Boyd. anor, 117(1-4):217-234, 2002. [doi]

From Revenue Management Concepts to Software SystemsNicola Secomandi, Kirk Abbott, Tankut Atan, E. Andrew Boyd. interfaces, 32(2):1-11, 2002. [doi]

2001

Optimizing fuel consumption on gas transmission networks: evaluation of a heuristic for cyclic systemsRoger Z. Ríos-Mercado, Seongbae Kim, E. Andrew Boyd. SMC 2001: 3118-3122 [doi]

1998

An Efficient Algorithm for Solving an Air Traffic Management Model of the National Airspace SystemE. Andrew Boyd, Rusty Burlingame, Kenneth Lindsay. informs, 10(4):417-426, 1998. [doi]

Cutting planes for mixed-integer knapsack polyhedraXiao-Qing Yan, E. Andrew Boyd. mp, 81:257-262, 1998.

1997

A fully polynomial epsilon approximation cutting plane algorithm for solving combinatorial linear programs containing a sufficiently large ballE. Andrew Boyd. orl, 20(2):59-63, 1997. [doi]

1996

On the Complexity of a Cutting Plane Algorithm for Solving Combinatorial Linear ProgramsE. Andrew Boyd. siamdm, 9(3):365-376, 1996. [doi]

1995

Resolving degeneracy in combinatorial linear programs: steepest edge, steepest ascent, and parametric ascentE. Andrew Boyd. mp, 68:155-168, 1995.

On the Convergence of Fenchel Cutting Planes in Mixed-Integer ProgrammingE. Andrew Boyd. siamjo, 5(2):421-435, 1995. [doi]

1994

Fenchel Cutting Planes for Integer ProgramsE. Andrew Boyd. ior, 42(1):53-64, 1994. [doi]

Solving 0/1 integer programs with enumeration cutting planesE. Andrew Boyd. anor, 50(1):61-72, 1994. [doi]

1993

Solving integer programs with Fenchel cutting planes and preprocessingE. Andrew Boyd. ipco 1993: 209-220

Polyhedral Results for the Precedence-Constrained Knapsack ProblemE. Andrew Boyd. DAM, 41(3):185-201, 1993. [doi]

Solving integer programs with Fenchel cutting planes and preprocessingE. Andrew Boyd. npsc, 1:453-466, 1993.

Generating Fenchel Cutting Planes for Knapsack PolyhedraE. Andrew Boyd. siamjo, 3(4):734-750, 1993. [doi]

1992

A pseudopolynomial network flow formulation for exact knapsack separationE. Andrew Boyd. networks, 22(5):503-514, 1992. [doi]

1990

An algorithmic characterization of antimatroidsE. Andrew Boyd, Ulrich Faigle. DAM, 28(3):197-205, 1990. [doi]

Polyhedral Results for the Precedence-Constrained Knapsack ProblemE. Andrew Boyd. ipco 1990: 85-100

Sign in or sign up to see more results.

runs on WebDSL