Institutional Repository

Browsing SAICSIT Digital Archive by Author "Steyn, T"

Browsing SAICSIT Digital Archive by Author "Steyn, T"

Sort by: Order: Results:

  • An AI search algorithm to obtain the shortest simplex path 
    Scott, TG; Hattingh, J.M.; Steyn, T (South African Computer Society (SAICSIT), 1996)
    The simplex method is one way of solving a linear programming problem (LP-problem). An A* search algorithm based on a certain evaluation function has been developed to obtain the shortest path to an optimal solution within ...
  • 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 ...
  • Die versoening van konflikterende doelwitte in die databasisomgewing met behulp van regressiemetodes 
    Jordaan, DB; Hattingh, J.M.; Steyn, T (South African Computer Society (SAICSIT), 1993)
    Daar bestaan baie voorbeelde in die dataverwerkingswêreld van gebruikers wat nie die inligting vanuit huIlle rekenaarstelsels kry wat hulle nodig het nie [26]. Nuwe en onvoorsiene vrae en versoeke vir inligting neem by die ...
  • The feasibility problem in the simplex algorithm 
    Scott, TG; Hattingh, JM; Steyn, T (1996)
    The simplex method is one way of solving a linear programming problem (LP-problem). The simplex method needs a basic feasible solution to start the solution process. This requires an available non-singular basis. Normally ...

Search UnisaIR


Browse

My Account