Author:
Burkova Irina,Titarenko Boris,Zheglova Yulia
Abstract
New method of multi-extremal optimization has been developed - a network programming method, which is based on the possibility to represent a complex function as a superposition of simpler functions. The paper deals with network (dichotomous) programming method and its application for solving multi-extremal and discrete optimization problems in Project Management. The main goal of the paper is to develop a new approach to solving knapsack problem and to solve a number of optimization problems of project building management. The optimal structure of the dichotomous representation is determined. On the basis dichotomous programming method new algorithm to solve a optimization problem is proposed
Reference17 articles.
1. Aggarwal G. and Hartline J., Knapsack auctions. In SODA, 1083–1092, 2006.
2. Bretthauer K., Shetty B. and Syam S., A branch and bound algorithm for integer quadratic knapsack problems, Manuscript, Texas A&M University (1993), to appear in ORSA J. Computing.
3. An O(n) algorithm for quadratic knapsack problems
4. Brucker P., Scheduling Algorithms (Springer-Verlag, 2001)