Combinatorial branch and bound searches are a common technique for solving global optimisation and decisionproblems. Their performance oftendepends on good search order heuristics, refined over decades of algorithms research. Parallel search necessarily deviates from the sequential search order, sometimes dramatically and unpredictably, e.g. by distributing work at random. This can disrupt effe...

We recently developed a new randomized optimization framework, the Nested Partitions (NP) method. This approach uses partitioning, random sampling, promising index, and backtracking to create a Markov chain that has global optima as its absorbing states. This new method combines global search and local search (heuristic) procedures in a nature way and it is highly matched to emerging massively ...

In this study, a temperature parallel simulated annealing with adaptive neighborhood (TPSA/AN) for continuous optimization problems is introduced. TPSA/AN is based on the temperature parallel simulated annealing (TPSA), which is suitable for parallel processing, and the SA that Corana developed for continuous optimization problems. The moves in TPSA/AN are adjusted to have equal acceptance rate...

In this paper, a Temperature Parallel Simulated Annealing with Adaptive Neighborhood (TPSA/AN) for continuous optimization problems is introduced. TPSA/AN is based on the temperature parallel simulated annealing (TPSA), which is suitable for parallel processing, and the SA that Corana developed for continuous optimization problems. The moves in TPSA/AN are adjusted to have equal acceptance rate...

There has been much reflection on the need for a new understanding of global health and the urgency of a paradigm shift to address global health issues. A crucial question is whether this is still possible in current modes of global governance based on capitalist values. Four reflections are provided. (1) Ecological–centered values must become central in any future global health framework. (2) ...