This article investigates Gray Box Optimization for pseudo-Boolean optimization problems
composed of M subfunctions, where each subfunction accepts at most k variables. We will …

Landscape analysis is a very useful tool in optimization to understand the structure of the
search space of a problem when there is some kind of distance or neighborhood defined …

We evaluate the performance of estimating the number of local optima by estimating their
proportion in the search space using simple random sampling (SRS). The performance of …

Partition Crossover induces lattices over subsets of local optima in the search spaces of
classic combinatorial problems such as MAX-SAT and the Traveling Salesman Problem …

A new construction is introduced for creating random MAX-3SAT instances with low
nonlinearity. Instead of generating random clauses, we generate random SAT expressions …

The efficiency of local search is proportional to the number and the distribution of basins of
attraction. Often combinatorial optimisation problems have a large number of local optima …

Discrete optimization deals with the identification of combinations or permutations of
elements that are optimal with regard to a specific, quantitative criterion. Applications arise …

Brian W. Goldman Peer Reviewed Publications (15 Total) Page 1 Brian W. Goldman Curriculum
Vitae November 2016 Address: Google, Building 2600, Boulder, Colorado. Phone …