•  I develop and analyze optimization models for studying complex adaptive systems consisting of a number of individual parts that interact with each other in complex ways. Much of this research applies to general complex systems while some work focuses on the specific complex system of a team in an organization, with an emphasis on the role and impact of leadership.
• I do basic research in deterministic optimization, including combinatorial optimization, linear and nonlinear programming. This work tends to focus on developing new algorithms for solving existing optimization problems and improving  the efficiency of existing algorithms.

Papers in each of these areas are listed below and clicking on the title will bring up the associated abstract. For a copy of a paper, please send an e-mail to daniel.solow@case.edu.

Papers in Complex Adaptive Systems

Mathematical and Computational Models of Leadership: Past and Future, J. K. Hazy, W. Millhiser, and D. Solow, in J. K. Hazy, J. Goldstein & B. B. Lichtenstein (Eds.), Complex Systems Leadership Theory (Chapter 9). Mansfield, MA: ISCE Publishing Company, Mansfield, MA, 2007. (Book Chapter)

How Large Should a Complex System Be? An Application in Organizational Teams, Complexity, Will Millhiser and Daniel Solow, 12(4), 54 – 70, March/April 2007.

The Role of Leadership: What Management Science Can Give Back to the Study of Complex Systems, Daniel Solow and Joe Szmerekovsky, Emergence: Complexity and Organization, 8(4), 52 – 60, December, 2006.

Mathematical Models for Studying the Value of Motivational Leadership in Teams, Daniel Solow, Apostolos Burnetas, Sandy Kristen Piderit, and Chartchai Leenawong, Computational and Mathematical Organization Theory, 11(1), 5-36, May, 2005.

Mathematical Models for Explaining the Emergence of Specialization in Performing Tasks, Daniel Solow and Joe Szmerekovsky, Complexity, 10(1), 37-48, September/October, 2004.

Mathematical Models for Studying the Value of Cooperational Leadership in Team Replacement, Daniel Solow and Chartchai Leenawong, Computational and Mathematical Organization Theory, 9(1), 61-81, May, 2003.

Managerial Insights into the Effects of Interactions on Replacing Members of a Team, Daniel Solow, George Vairaktarakis, Sandy Kristen Piderit, Ming-chi Tsai, Management Science, 48(8), 1060-1073, 2002.

On the Expected Performance of Systems with Complex Interactions Among Components, Daniel Solow, Apostolos Burnetas, Ming-chi Tsai, and Neil Greenspan, Complex Systems, 12(4), 423-456, 2000.

On the Challenge of Developing a Formal Mathematical Theory for Establishing Emergence in Complex Systems, Complexity, 6(1), 49-52, 2000.

Improving the Efficiency of the Simplex Algorithm Based on a Geometric Explanation of Phase 1, Daniel Solow and Hans Halim, International Journal of Operational Research, 5(4), 408 - 428, 2009.

Linear and Nonlinear Programming, in Encyclopedia of Computer Science and Engineering (Benjamin Wah, ed.) Hoboken: John Wiley & Sons, Inc., 3, 1744-1748, January, 2009.

A Constrained Optimization Approach to Solving Certain Systems of Convex Equations, Daniel Solow and Hantao Li, European Journal of Operational Research, 176(3), 1334 – 1347, February, 2007.

Vehicle Routing and Scheduling with Full Truck Loads, S. Arunapuram, Kamlesh Mathur, and Daniel Solow, Transportation Science 37(2), 170-182, May 2003.

The Effectiveness of Finite Improvement Algorithms for Finding Global Optima, Daniel Solow and Sheldon Jacobson, ZOR: Methods and Models of Operations Research, 37(3), 1993.

A Finite Improvement Algorithm for the Linear Complementarity Problem, Daniel Solow and Konstatinos Paparrizos, European Journal of Operations Research, 3, 305-324, 1989.

A Finite Descent Theory for Linear Programming, Piecewise Linear Convex Minimization and the Linear Complementarity Problem, Daniel Solow and Partha Sengupta, Naval Research Logistics Quarterly, 32, 417-431, 1985.

Finite Search Procedures in Operations Research and Combinatorial Optimization, Proceedings of the 4th Mathematical Programming Symposium of Japan, November 1983.

Homeomorphisms of Triangulations with Applications to Computing Fixed Points, Mathematical Programming, 20(2), 213-224, 1981.

Comparative Computer Results of a New Complementary Pivot Algorithm for Solving Equality Constrained Optimization Problems, Mathematical Programming, 18(2), 168-185, 1980.

Decomposability in Fixed Point Computation with Applications and Acceleration Techniques, Journal of Mathematical Analysis and Applications, 71(2), 558-579, 1979.