Application network programming method – knapsack problem and it’s modification

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-...

Full description

Saved in:
Bibliographic Details
Published inE3S web of conferences Vol. 410; p. 3017
Main Authors Burkova, Irina, Titarenko, Boris, Zheglova, Yulia
Format Journal Article Conference Proceeding
LanguageEnglish
Published Les Ulis EDP Sciences 01.01.2023
Subjects
Knapsack problem
Optimization
Programming
Project management
Online AccessGet full text
ISSN2267-1242
2555-0403
2267-1242
DOI10.1051/e3sconf/202341003017

Cover

More Information
Summary: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
Bibliography:ObjectType-Conference Proceeding-1
SourceType-Conference Papers & Proceedings-1
content type line 21
ISSN:2267-1242
2555-0403
2267-1242
DOI:10.1051/e3sconf/202341003017