Browsing Faculty Publications (Bibliographic) by Author "Sierksma, Gerard"
Now showing items 1-5 of 5
-
Data Correcting Algorithms in Combinatorial Optimization
Ghosh, Diptesh; Goldengorin, Boris; Sierksma, Gerard (2010-11-12) -
Data Correcting: A Methodology for Obtaining Near Optimal Solutions
Ghosh, Diptesh; Goldengorin, Boris; Sierksma, Gerard (2010-07-07) -
Iterative patching and the asymmetric travelling salesman problem
Turkensteen, M.; Ghosh, Diptesh; Goldengorin, Boris; Sierksma, Gerard (2006-10-28) -
Sensitivity analysis of the greedy heuristic for binary knapsack problems
Ghosh, Diptesh; Chakravarti, N.; Sierksma, Gerard (2006-10-27)Greedy heuristics are a popular choice of heuristics when we have to solve a large variety of N P-hard combinatorial problems. In particular for binary knapsack problems, these heuristics generate good results. If some ... -
Tolerance -based Branch and Bound Algorithms
Turkensteen, M.; Ghosh, Diptesh; Goldengorin, Boris; Sierksma, Gerard (2010-11-12)