From 83a02a37e66ebaa98938564407bb130ef403ba3a Mon Sep 17 00:00:00 2001
From: jsprit <4sschroeder@gmail.com>
Date: Tue, 18 Jun 2013 06:48:50 +0300
Subject: [PATCH] Update README.md

---
 README.md | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/README.md b/README.md
index 068c13b0..5f2d27b1 100644
--- a/README.md
+++ b/README.md
@@ -1,14 +1,14 @@
 jsprit
 ======
 jsprit is a java based, open source toolkit for solving a set of well-known [vehicle routing problems](http://neo.lcc.uma.es/vrp/vehicle-routing-problem/) (VRP). 
-It is lightweight and easy-to-use, and based on heuristics currently solving the following problems:
+It is lightweight and easy-to-use, and based on heuristics currently solving 
 - [Capacitated VRP](http://neo.lcc.uma.es/vrp/vrp-flavors/capacitated-vrp/)
 - [Multiple Depot VRP](http://neo.lcc.uma.es/vrp/vrp-flavors/multiple-depot-vrp/)
 - [VRP with time windows](http://neo.lcc.uma.es/vrp/vrp-flavors/vrp-with-time-windows/)
 - VRP with heterogeneous fleet
 - Time-dependent VRP
 
-Modifying the algorithms and visualising the discovered solutions is as easy and handy as 
+and various combination of these problem types. Modifying the algorithms and visualising the discovered solutions is as easy and handy as 
 reading classical VRP instances to benchmark your algorithm.