1985
DOI: 10.1016/0041-5553(85)90008-4
|View full text |Cite
|
Sign up to set email alerts
|

The use of duality to increase the effectiveness of the branch and bound method when solving the knapsack problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
3
3
1

Relationship

0
7

Authors

Journals

citations
Cited by 9 publications
(4 citation statements)
references
References 3 publications
0
4
0
Order By: Relevance
“…Conventionally determined models allow obtaining acceptable damage estimates with a short period of retrospection and small amounts of information, and stochastic models with significantly large amounts. In order to increase the objectivity of forecasts due to minimization of subjective information used in modeling, uncertainty relief in building both conditionally determined and stochastic models is based on the "maximum uncertainty" principle formalized in the form of maximum entropy [5][6][7]. 3 Results of the study…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…Conventionally determined models allow obtaining acceptable damage estimates with a short period of retrospection and small amounts of information, and stochastic models with significantly large amounts. In order to increase the objectivity of forecasts due to minimization of subjective information used in modeling, uncertainty relief in building both conditionally determined and stochastic models is based on the "maximum uncertainty" principle formalized in the form of maximum entropy [5][6][7]. 3 Results of the study…”
Section: Methodsmentioning
confidence: 99%
“…In general, the presented ratios (1) -(4), (8), (9), (13), (14) are a conditionally determined model for forecasting in the interests of the energy management of economic damage during technological accidents at energy facilities and in power supply systems enterprises under assumptions (6), (7).…”
Section: Methodical Approach To the Construction Of Conditionally Detmentioning
confidence: 99%
“…Problem (7) -(13) belongs to the non-linear problems of distributing discrete on-uniform resources in the random network. It is NPa complex problem of discrete programming [4][5][6]. Precise methods of solving problems of such class have been offered for the first time in [7][8].…”
Section: Cc-tesc2018mentioning
confidence: 99%
“…Within this framework, one of the most important categories is the optimal distribution of discrete resources [1][2][3][4][5]. For the realtime mode AIMS the allocation of resources present a multistaged process [6,7].…”
Section: Introductionmentioning
confidence: 99%