2012
DOI: 10.1007/978-1-4471-4600-1_22
|View full text |Cite
|
Sign up to set email alerts
|

On Solution Method of the Knapsack Problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2014
2014
2014
2014

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 0 publications
0
1
0
Order By: Relevance
“…If any point X 1 (n,k) on the hyper arch is known, we find intersection hyper plane (W,X) =(W,X 1 (n,k)) and the line W min W max and denote it by T. Then transfer in a parallel way the point T on the hyper circle in the direction of the vector L = , E FFFFFFFFFFFFFFFFFFFG . ' , = T + L. Calculation experiments given in [4].…”
Section: Estimation Of the Number Of Iterations And Its Decreasementioning
confidence: 99%
“…If any point X 1 (n,k) on the hyper arch is known, we find intersection hyper plane (W,X) =(W,X 1 (n,k)) and the line W min W max and denote it by T. Then transfer in a parallel way the point T on the hyper circle in the direction of the vector L = , E FFFFFFFFFFFFFFFFFFFG . ' , = T + L. Calculation experiments given in [4].…”
Section: Estimation Of the Number Of Iterations And Its Decreasementioning
confidence: 99%