Institutional Repository

Browsing School of Computing by Author "Kruger, MF"

Browsing School of Computing by Author "Kruger, MF"

Sort by: Order: Results:

  • Cardinality constrained 0-1 Knapsack problems 
    Kruger, MF; Hattingh, JM; Steyn, T (2000)
    The Knapsack Problem is one of the most important problems in Discrete optimization. Although it is the simplest integer program, it has numerous practical applications and often appears as a subproblem in solving more ...
  • A partitioning scheme for solving the exact K-item 0-1 knapsack problem 
    Kruger, MF; Hattingh, JM (1998)
    Our investigation on the impact of partitioning the search space of the classical 0- 1 Knapsack Problem through the inclusion of equality constraints on the knapsack's cardinality, has given rise to the study we undertook ...

Search UnisaIR


Browse

My Account