The WordPress.com stats helper monkeys prepared a 2011 annual report for this blog.
Here’s an excerpt:
A San Francisco cable car holds 60 people. This blog was viewed about 2,300 times in 2011. If it were a cable car, it would take about 38 trips to carry that many people.
As I wrote some time ago, I recently migrated from linux to OSX. Since this OS was very new to me, it took me a while to figure out which applications were useful to me and which customisations added to my productivity. This article is a list for people new to OSX and want to hit the ground running. It is basically the article I would have liked to have found when I first migrated.
In a previous post I presented an approach to solve the shortest path problem using different implementations of algorithms. The shortest path problem is a classic and important combinatorial optimisation problem. It often appears as a subproblem when solving difficult combinatorial problems like the multicommodity network flow (MCNF) problems.
The problem is to route a set of demands (commodities) through a network1 with limited arc capacities. The inherent assumption with the following implementation is that the commodities can be shipped in fractions, hence are divisible.
My name is Christos Delivorias and my primary knowledge interests lie in Computer Science and Complexity Optimization. This blog is personal and expresses solely my views and work. The main function of this blog is to help spread some of my ideas and work. If you find it useful you’re ... Continue reading »
