• Analysis of combinatorial search spaces for a class of NP-hard problems, An 

        Author(s):Sutton, Andrew M.
        Date Issued:2011
        Format:born digital; doctoral dissertations
        Given a finite but very large set of states X and a real-valued objective function ƒ defined on X, combinatorial optimization refers to the problem of finding elements of X that maximize (or minimize) ƒ. Many combinatorial ...