## Solving the Shortest Path Problem (5) – Benchmarks

This article of 2012 at http://stegua.github.io/ shows, that the type of the priority queue of a shortest path solver is crucial for the solving time. You have to agree with that, but there is another point to mention: the choice of Read More

## Solving the Shortest Path Problem (4) – Comparison of LEMON and BGL

In the previous articles I explained the usage of the APIs of LEMON and Boost Graph Library (BGL). Now I want to sum up the differences of them. Of course this is very opinion-based. 1. Simplicity LEMON has despite its Read More

## Solving the Shortest Path Problem (3) – Boost Graph Library

Boost Graph Library The Boost Graph library (BGL) is a part of the famous Boost library. The BGL graph interface and graph components are generic, in the same sense as the Standard Template Library (STL). As LEMON the BGL also Read More

## Solving the Shortest Path Problem (2) – LEMON Graph Library

LEMON Graph Library LEMON stands for Library for Efficient Modeling and Optimization in Networks. It is a C++ template library providing efficient implementations of common data structures and algorithms with focus on combinatorial optimization tasks connected mainly with graphs and Read More

## Solving the Shortest Path Problem (1) – Intro

Shortest Path Problem 3 years later I’m back with a new article in my blog – time flies.. The Shortest Path Problem is a common problem to nearly anyone nowadays. Anyone who used a navigation system or Google Maps for Read More

## pyMCFsimplex – Efficient Solving of Minimum Cost Flow Problems in Python

pyMCFsimplex – a Python Wrapper for MCFSimplex pyMCFimplex is a Python-Wrapper for the C++ MCFSimplex Solver Class from the Operations Research Group at the University of Pisa. MCFSimplex is a piece of software hat solves big sized Minimum Cost Flow Read More

## Solving the Minimum Cost Flow Problem (6) – Google or-tools

Push-relabel algorithm: Google or-tools At last we will solve the instance of a Minimum cost flow problem described in (1) with Google or-tools. Node 1 is the source node, nodes 2 and 3 are the transshipment nodes and node 4 Read More

## Solving the Minimum Cost Flow problem (5) – NetworkX

Network Simplex Solver: NetworkX We will solve the instance of a Minimum cost flow problem described in (1) with NetworkX. Node 1 is the source node, nodes 2 and 3 are the transshipment nodes and node 4 is the sink Read More

## Solving the Minimum Cost Flow problem (4) – PuLP

Linear program solvers: PuLP We will solve the instance of a Minimum cost flow problem described in (1) now with another linear program solver: PuLP. Node 1 is the source node, nodes 2 and 3 are the transshipment nodes and Read More

## Solving the Minimum Cost Flow problem (3) – lpsolve

Linear program solvers: Lpsolve In the following articles we will solve the instance of a Minimum cost flow problem described in (1). Node 1 is the source node, nodes 2 and 3 are the transshipment nodes and node 4 is Read More