John A. Tomlin - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 21 from 21

2008

George B. Dantzig and systems optimizationPhilip E. Gill, Walter Murray, Michael A. Saunders, John A. Tomlin, Margaret H. Wright. disopt, 5(2):151-158, 2008. [doi]

2007

Branch and bound, integer, and non-integer programmingJohn J. H. Forrest, John A. Tomlin. anor, 149(1):81-87, 2007. [doi]

2005

Matrix Methods for Lost Data Reconstruction in Erasure CodesJames Lee Hafner, Veera Deenadhayalan, K. K. Rao, John A. Tomlin. FAST 2005: [doi]

2004

Ranking the web frontierNadav Eiron, Kevin S. McCurley, John A. Tomlin. WWW 2004: 309-318 [doi]

2003

2001

An adaptive model for optimizing performance of an incremental web crawlerJenny Edwards, Kevin S. McCurley, John A. Tomlin. WWW 2001: 106-113 [doi]

Web Query Characteristics and their Implications on Search EnginesJason Y. Zien, Jörg Meyer, John A. Tomlin, Joy Liu. WWW 2001: [doi]

2000

An entropy approach to unintrusive targeted advertising on the WebJohn A. Tomlin. cn, 33(1-6):767-774, 2000. [doi]

1992

Implementing Interior Point Linear Programming Methods in the Optimization Subroutine LibraryJohn J. H. Forrest, John A. Tomlin. IBMSJ, 31(1):26-38, 1992.

Implementing the Simplex Method for the Optimization Subroutine LibraryJohn J. H. Forrest, John A. Tomlin. IBMSJ, 31(1):11-25, 1992.

1988

Special ordered sets and an application to gas supply operations planningJohn A. Tomlin. mp, 42(1-3):69-84, 1988. [doi]

1986

On projected newton barrier methods for linear programming and an equivalence to Karmarkar's projective methodPhilip E. Gill, Walter Murray, Michael A. Saunders, John A. Tomlin, Margaret H. Wright. mp, 36(2):183-209, 1986. [doi]

1983

Formal optimization of some reduced linear programming problemsJohn A. Tomlin, J. S. Welch. mp, 27(2):232-240, 1983. [doi]

1974

On pricing and backward transformation in linear programmingJohn A. Tomlin. mp, 6(1):42-47, 1974. [doi]

Technical Note - Generalized Upper Bounds and Triangular Decomposition in the Simplex MethodJohn A. Tomlin. ior, 22(3):664-668, 1974. [doi]

1972

An integer programming approach to a class of combinatorial problemsE. M. L. Beale, John A. Tomlin. mp, 3(1):339-344, 1972. [doi]

Updated triangular factors of the basis to maintain sparsity in the product form simplex methodJohn J. H. Forrest, John A. Tomlin. mp, 2(1):263-278, 1972. [doi]

1971

Technical Note - An Improved Branch-and-Bound Method for Integer ProgrammingJohn A. Tomlin. ior, 19(4):1070-1075, 1971. [doi]

Sign in or sign up to see more results.

runs on WebDSL