due to the particular importance of projects in human life and in organizations, proper project management has been always regarded highly by researchers and practitioners. recent advances in technology and fundamental changes in most scientific areas have affected projects and made their nature and environmental circumstances much more complex than in the past. fortunately, in recent years, ma...

Computational complexity is the study of the difficulty of solving computational problems, in terms of the required computational resources, such as time and space (memory). Whereas the analysis of algorithms focuses on the time or space requirements of an individual algorithm for a specific problem (such as sorting), complexity theory focuses on the complexity class of problems solvable in the...

The main text for the course is: Computational Complexity. Christos H. Papadimitriou. Introduction to the Theory of Computation. Michael Sipser. Other useful references include: Computers and Intractability: A guide to the theory of NP-completeness. Michael R. Garey and David S. Johnson. Structural Complexity. Vols I and II. J.L. Balcázar, J. Dı́az and J. Gabarró. Computability and Complexity fr...

today we are facing with a turbulent world full of complexity and change. contemporary problems are too complicated for rational, logical solutions. they admit insights, not answers. chaos theory is a solution to reveal insights into the structure and the dynamics of complex systems. chaos theory is in formative stage, but we can use it in management practices. this article is about application...

in the first part of the paper we survey some far reaching applications of the basis facts of linear programming to the combinatorial theory of simple polytopes. in the second part we discuss some recent developments concurring the simplex algorithm. we describe sub-exponential randomized pivot roles and upper bounds on the diameter of graphs of polytopes.