There is a new sorting algorithm a deterministic O(m log2/3 n)-time algorithm for single-source shortest paths (SSSP) on ...

This paper considers the problem of scheduling n jobs, each having a processing time, a due date and a weight, on a single machine to minimize the weighted number of late jobs. An O (n log n) ...

A nested loop/recursive algorithm like the OP suggested might perform in n^2 expected time while a better algorithm might perform in n*log expected time, where the expectation is over the ...

Awi Federgruen, Michal Tzur, A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0 (n $\log$ n) or 0 (n) Time, Management Science, Vol. 37, No. 8 (Aug., 1991), pp.