Using an advanced Monte Carlo method, Caltech researchers found a way to tame the infinite complexity of Feynman diagrams and ...

A methodology for combining a multiobjective evolutionary algorithm based on decomposition (MOEA/D) and linear program is proposed to solve this problem. MOEA/D optimizes the sequence of facilities on ...

By reformulating the linear multiplicative programming problem (LMP) as an equivalent nonconvex programming problem (EP), we present a new accelerating outcome space branch-and-bound algorithm for ...