diff --git a/README.md b/README.md
index cd14487b..5bc65b7f 100644
--- a/README.md
+++ b/README.md
@@ -6,7 +6,7 @@ It is lightweight and easy-to-use, and based on heuristics currently solving
 - <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>
 - VRP with Backhauls
-- VRP with Pickups and Deliveries (where either pickup or delivery has to be conducted at depot)
+- VRP with Pickups and Deliveries*
 - VRP with heterogeneous fleet
 - Time-dependent VRP
 - Various combination of these types
@@ -18,6 +18,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.
 
+*either pickup or delivery has to be conducted at the depot
+
 ##In Development
 - VRP with Backhauls
 - Pickup and Delivery