An improved branch and bound algorithm for mixed integer nonlinear programs. - Brian Borchers; John E. Mitchell 001 (Comput. Oper. Res., 1994)

A branch and cut algorithm for MAX-SAT and weighted MAX-SAT. - Steve Joy; John E. Mitchell 001; Brian Borchers (Satisfiability Problem: Theory and Applications, 1996)

Solving real-world linear ordering problems using a primal-dual interior point cutting plane method. - John E. Mitchell 001; Brian Borchers (Ann. Oper. Res., 1996)

A computational comparison of branch and bound and outer approximation algorithms for 0-1 mixed integer nonlinear programs. - Brian Borchers; John E. Mitchell 001 (Comput. Oper. Res., 1997)

A Two-Phase Exact Algorithm for MAX-SAT and Weighted MAX-SAT Problems. - Brian Borchers; Judith Furman (J. Comb. Optim., 1998)

The Lanczos Method: Evolution and Application, by Louis Komzsik. - Brian Borchers (Sci. Program., 2004)

Strength of landmine signatures under different soil conditions: implications for sensor fusion. - Remke L. Van Dam; Brian Borchers; Jan M. H. Hendrickx (Int. J. Syst. Sci., 2005)

Implementation of a primal-dual method for SDP on a shared memory parallel architecture. - Brian Borchers; Joseph G. Young (Comput. Optim. Appl., 2007)

Review of "Computational Techniques of the Simplex Method by István Maros", Kluwer Academic Publishers, 2003. - Brian Borchers (SIGACT News, 2007)

Review of practical optimization: algorithms and engineering applications by Andreas Antoniou and Wu-Sheng Lu (Springer Verlag, 2007). - Brian Borchers (SIGACT News, 2009)

MINLP: Branch and Bound Methods. - Brian Borchers (Encyclopedia of Optimization, 2009)

Updating the Fast Grain Boundary program: Temperature-time paths from intragrain oxygen isotope zoning. - Gabriel Kropf; Chloë Bonamici; Brian Borchers (Comput. Geosci., 2021)