Some of these software might help you. (Not all of them are open-source though.) *TreeD http://www.itu.dk/people/sathi/treed/ *dlib http://dlib.net/ *QuickBB http://www.cs.washington.edu/homes/...

There exists a stable in-place sorting algorithm with $O(n \log n)$ comparisons and $O(n)$ moves. See: Gianni Franceschini: Sorting Stably, in Place, with $O(n \log n)$ Comparisons and $O(n)$ Moves. ...

Keynote is one of the popular software, though I use PowerPoint

Theory of Computing Blog Aggregator for theoretical computer science

There is a sort algorithm with $O(1)$ auxiliary words and achieving $O(n\log n)$ worst-case run time, where $n$ is the length of the input array. http://www.springerlink.com/content/d7348168624070v7/ ...

Your problem is the multiple knapsack problem. Although I am not familiar with this problem, I believe you'll find some papers on your problem, since there are many papers on this problem (see for ...

Your problem is a generalization of the sharing-aware virtual machine colocation problem, and so hard to approximate. Read this paper for more information: Michael Sindelar, Ramesh K. Sitaraman, ...

Strictly speaking, the paper pointed out by singsumit handles the P2P shortest path problem (not the all pairs shortest paths problem). If you really want to compute the all pairs shortest paths ...

The stable marriage instance with ties is solvable in polynomial time, whereas the stable marriage instance with incomplete lists and ties is NP-hard. The same holds for the Hospitals/Residents ...

It is well known that an instance of $n$ men/women can have an exponential number ($O(2^n)$) of stable matchings, but giving a tight upper bound is still open. See Encyclopedia of algorithms http://...

Although I am not sure what you mean by "random", obvious natural non-scale-free graphs are the road networks.

Although many efficient set intersection algorithms have been proposed in the literature, my recommendation is the algorithm proposed in this paper: Bolin Ding, Arnd Christian König: Fast Set ...

Removing the min/max operations in your problem, you can write your problem in a standard mixed integer programming. If your problem contains $N$ min/max operations, then your problem can be solved ...