From 23c84f4b7e1f50817c132e511852ef5e09274115 Mon Sep 17 00:00:00 2001
From: jsprit <jsprit.vehicle.routing@gmail.com>
Date: Thu, 10 Oct 2013 08:35:43 +0200
Subject: [PATCH] Update README.md

---
 README.md | 4 +++-
 1 file changed, 3 insertions(+), 1 deletion(-)

diff --git a/README.md b/README.md
index c479a7c1..cfd9ef64 100644
--- a/README.md
+++ b/README.md
@@ -5,7 +5,7 @@ It is lightweight and easy-to-use, and based on heuristics currently solving
 - <a href="http://neo.lcc.uma.es/vrp/vrp-flavors/capacitated-vrp/" target="_blank">Capacitated VRP</a>
 - <a href="http://neo.lcc.uma.es/vrp/vrp-flavors/multiple-depot-vrp/" target="_blank">Multiple Depot VRP</a>
 - <a href="http://neo.lcc.uma.es/vrp/vrp-flavors/vrp-with-time-windows" target="_blank">VRP with Time Windows</a>
-- <a href="http://neo.lcc.uma.es/vrp/vrp-flavors/vrp-with-backhauls/" target="_blank">VRP with Backhauls</a> (pickups and deliveries from and/to depot)
+- <a href="http://neo.lcc.uma.es/vrp/vrp-flavors/vrp-with-backhauls/" target="_blank">VRP with Backhauls</a>*
 - VRP with Heterogeneous Fleet
 - Time-dependent VRP
 - Various combination of these types
@@ -17,6 +17,8 @@ Additionally, jsprit can be used along with <a href="http://www.matsim.org" targ
 to solve the above problem-types in real networks (i.e. without preprocessing transport times and costs). A variety of least cost path algorithms such as Dijkstra and A*
 can be used, and a dynamic and interactive visualiser greatly enhances the analysis.
 
+*pickups and deliveries from and/to depot
+
 ##In Development
 - continues improvement of code, handling and performance
 - stable API to easily build algorithms from scratch