1. A new adaptive multi-start technique for combinatorial global optimizations
2. E. Boros and P.L. Hammer. 2002. Pseudo-Boolean Optimization. Discrete applied mathematics 123 1 (2002) 155--225. E. Boros and P.L. Hammer. 2002. Pseudo-Boolean Optimization. Discrete applied mathematics 123 1 (2002) 155--225.
3. W. Chen and D. Whitley . 2017. Decomposing SAT instances with pseudo backbones . In 17th European Conference on Evolutionary Computation Combinatorial Optimization (EVOCOP). Springer, LNCS. W. Chen and D. Whitley. 2017. Decomposing SAT instances with pseudo backbones. In 17th European Conference on Evolutionary Computation Combinatorial Optimization (EVOCOP). Springer, LNCS.
4. W. Chen , D. Whitley , F. Chicano , and R. Tinós . 2018. Tunneling between plateaus: improving on a state-of-the-art MAXSAT solver using partition crossover . In Genetic and Evolutionary Computation Conference (GECCO). ACM, 921--928 . W. Chen, D.Whitley, F. Chicano, and R. Tinós. 2018. Tunneling between plateaus: improving on a state-of-the-art MAXSAT solver using partition crossover. In Genetic and Evolutionary Computation Conference (GECCO). ACM, 921--928.
5. F. Chicano , D. Whitley , G. Ochoa , and R. Tinós . 2017. Optimizing one million variable NK landscapes by hybridizing deterministic recombination and local search . In Genetic and Evolutionary Computation Conference (GECCO). ACM, 753--760 . F. Chicano, D. Whitley, G. Ochoa, and R. Tinós. 2017. Optimizing one million variable NK landscapes by hybridizing deterministic recombination and local search. In Genetic and Evolutionary Computation Conference (GECCO). ACM, 753--760.