“We had to control how big a number shows up as we do this guessing and coordination,” said Peng. Peng and Vempala prove that their algorithm can solve any sparse linear system in n2.332 steps. This ...

We consider the n-period economic lot sizing problem, where the cost coefficients are not restricted in sign. In their seminal paper, H. M. Wagner and T. M. Whitin proposed an O (n 2) algorithm for ...

With the Space Partition Tree and Graph (SPTAG) algorithm that is at the core of the open-sourced Python library, Microsoft is able to search through billions of pieces of information in milliseconds.

We develop an effective Variable Neighborhood Search algorithm based on the use of cyclic-exchange neighborhoods that incorporates an adaptive mechanism to bias the random shaking step.