The following pages link to E. Andrew Boyd (Q1208479):
Displayed 17 items.
- Polyhedral results for the precedence-constrained knapsack problem (Q1208480) (← links)
- Cutting planes for mixed-integer knapsack polyhedra (Q1290620) (← links)
- Solving \(0/1\) integer programs with enumeration cutting planes (Q1339119) (← links)
- A fully polynomial epsilon approximation cutting plane algorithm for solving combinatorial linear programs containing a sufficiently large ball (Q1376264) (← links)
- (Q1765538) (redirect page) (← links)
- Towards the real time solution of strike force asset allocation problems (Q1765539) (← links)
- Resolving degeneracy in combinatorial linear programs: Steepest edge, steepest ascent, and parametric ascent (Q1804357) (← links)
- A reduction technique for natural gas transmission network optimization problems (Q1861930) (← links)
- Efficient operation of natural gas transmission systems: a network-based heuristic for cyclic structures (Q2489290) (← links)
- An algorithmic characterization of antimatroids (Q2640448) (← links)
- A pseudopolynomial network flow formulation for exact knapsack separation (Q4014772) (← links)
- (Q4234144) (← links)
- Generating Fenchel Cutting Planes for Knapsack Polyhedra (Q4277510) (← links)
- Fenchel Cutting Planes for Integer Programs (Q4287599) (← links)
- (Q4319519) (← links)
- On the Convergence of Fenchel Cutting Planes in Mixed-Integer Programming (Q4838962) (← links)
- On the Complexity of a Cutting Plane Algorithm for Solving Combinatorial Linear Programs (Q4895628) (← links)