Brian T. Downs
Southern Methodist University
5 Papers
15 Citations
Brian T. Downs is an academic researcher from Southern Methodist University. The author has contributed to research in topics: Linear programming & Statistical process control. The author has an hindex of 4, co-authored 5 publications.
Chat about Author
Papers
A comparison of reserve selection algorithms using data on terrestrial vertebrates in Oregon
Blair Csuti,Stephen Polasky,Paul H. Williams,Robert L. Pressey,Jeffrey D. Camm,Melanie Kershaw,A. Ross Kiester,Brian T. Downs,Richard Hamilton,Manuela M. P. Huso,Kevin Sahr +10 more
TL;DR: The near-optimality, speed and simplicity of heuristic algorithms suggests that they are acceptable alternatives for many reserve selection problems, especially when dealing with large data sets or complicated analyses.
476
A Mathematical Programming Method for Generating Alternative Managerial Performance Goals After Data Envelopment Analysis
Jeffrey D. Camm,Brian T. Downs +1 more
- 01 Jan 1993
TL;DR: This paper discusses, via mathematical programming, a way of determining alternative possible courses of action for the manager of a DMU that has been deemed inefficient.
Mistake-Proofing and Measurement Control Charts
John R. Grout,Brian T. Downs +1 more
TL;DR: The authors demonstrate that Shingo's process control techniques - self-checks and mistake-proofing devices - are demonstrated to be effective for controlling processes.
6
An Economic Analysis of Inspection Costs for Failsafing Attributes
John R. Grout,Brian T. Downs +1 more
- 01 Jan 1995
TL;DR: In this article, the authors considered processes that have attributes as a primary quality characteristic and used an existing model for checking proper operating conditions to find how low the cost of source-inspection must be in order for it to be economical.
An exact algorithm for the maximal covering problem
Brian T. Downs,Jeffrey D. Camm +1 more
TL;DR: In this article, a robust, exact algorithm for the maximal covering problem (MCP) using dual-based solution methods and greedy heuristics in branch and bound is presented.