Daniel Solow

Orcid: 0000-0003-0553-8638

According to our database1, Daniel Solow authored at least 21 papers between 1980 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Novel Approaches to Feasibility Determination.
ACM Trans. Model. Comput. Simul., 2021

2020
Improved heuristics for finding balanced teams.
IISE Trans., 2020

Feasibility Determination When the Feasible Region is Defined by Non-Linear Inequalities.
Proceedings of the Winter Simulation Conference, 2020

2017
Emergency relocation of items using single trips: Special cases of the Multiple Knapsack Assignment Problem.
Eur. J. Oper. Res., 2017

2014
Setting leadership goals and getting those goals accomplished: insights from a mathematical model.
Comput. Math. Organ. Theory, 2014

2011
Understanding the Role of Worker Interdependence in Team Selection.
Organ. Sci., 2011

2008
Linear and Nonlinear Programming.
Proceedings of the Wiley Encyclopedia of Computer Science and Engineering, 2008

2007
A constrained optimization approach to solving certain systems of convex equations.
Eur. J. Oper. Res., 2007

How large should a complex system be? An application in organizational teams.
Complex., 2007

2005
Mathematical Models for Studying the Value of Motivational Leadership in Teams.
Comput. Math. Organ. Theory, 2005

2004
Mathematical models for explaining the emergence of specialization in performing tasks.
Complex., 2004

2003
Vehicle Routing and Scheduling with Full Truckloads.
Transp. Sci., 2003

Mathematical Models for Studying the Value of Cooperational Leadership in Team Replacement.
Comput. Math. Organ. Theory, 2003

2002
Managerial Insights into the Effects of Interactions on Replacing Members of a Team.
Manag. Sci., 2002

2000
On the Expected Performance of Systems with Complex Interactions Among Components.
Complex Syst., 2000

On the challenge of developing a formal mathematical theory for establishing emergence in complex systems.
Complex., 2000

1999
Understanding and attenuating the complexity catastrophe in Kauffman's <i>N K</i> model of genome evolution.
Complex., 1999

1997
An Analysis and Implementation of an Efficient In-Place Bucket Sort.
Acta Informatica, 1997

1993
The effectiveness of finite improvement algorithms for finding global optima.
ZOR Methods Model. Oper. Res., 1993

1981
Homeomorphisms of triangulations with applications to computing fixed points.
Math. Program., 1981

1980
Comparative computer results of a new complementary pivot algorithm for solving equality and inequality constrained optimization problems.
Math. Program., 1980


  Loading...