Finding the optimal solution to a problem with an enormous search space can be challenging. Unless a combinatorial construction technique is found that also guarantees the optimality of the resulting solution, this could be an infeasible task. If such a technique is unavailable, different heuristic methods are generally used to improve the upper bound on the size of the optimal solution. This dissertation presents an alternative method which can be used to improve a solution to a problem rather than construct a solution from scratch.
Download count: 0
- Partial requirement for: Ph. D., Arizona State University, 2011Note typethesis
- Includes bibliographical references (p. 68-74)Note typebibliography
- Field of study: Computer science