diff --git a/README.md b/README.md
index a305b5fe4b400c77275ce0365fd75a9f9376a87d..48138cfe97fd901d74dcb07061ec4fd957633a55 100644
--- a/README.md
+++ b/README.md
@@ -1,26 +1,30 @@
 # Labeling Algorithm for EVRPTW-PLR
 
-This repository contains the code used in the labelling algorithm for an ESPPRC, presented in "Pricing for the EVRPTW with Piecewise Linear
-Charging by a Bounding-Based Labelling Algorithm" by J. Enerbäck, L. Eveborn and E. Rönnberg, title of journal, pages, 2024. 
+This repository contains the code for the work presented in "Pricing for the EVRPTW with Piecewise Linear Charging by a Bounding-Based Labelling Algorithm" by J. Enerbäck, L. Eveborn and E. Rönnberg. The paper can be found at: https://doi.org/10.4230/OASIcs.ATMOS.2024.3
 
 If you use the code from this repository, please cite
 ```
-@inproceedings{2024...,
-    author = {Enerbäck, J., Eveborn, L. and Rönnberg, E.},
-    title = {Pricing for the EVRPTW with Piecewise Linear
-    Charging by a Bounding-Based Labelling Algorithm},
-    booktitle = {},
-    editor = {},
-    year = {2024},
-    pages = {},
-    url = {},
-    doi = {},
-    publisher = {},
+@InProceedings{enerback_et_al:OASIcs.ATMOS.2024.3,
+  author =	{Enerb\"{a}ck, Jenny and Eveborn, Lukas and R\"{o}nnberg, Elina},
+  title =	{{Pricing for the EVRPTW with Piecewise Linear Charging by a Bounding-Based Labeling Algorithm}},
+  booktitle =	{24th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2024)},
+  pages =	{3:1--3:18},
+  series =	{Open Access Series in Informatics (OASIcs)},
+  ISBN =	{978-3-95977-350-8},
+  ISSN =	{2190-6807},
+  year =	{2024},
+  volume =	{123},
+  editor =	{Bouman, Paul C. and Kontogiannis, Spyros C.},
+  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
+  address =	{Dagstuhl, Germany},
+  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2024.3},
+  URN =		{urn:nbn:de:0030-drops-211911},
+  doi =		{10.4230/OASIcs.ATMOS.2024.3},
+  annote =	{Keywords: ESPPRC, EVRP, Bounding, Labeling Algorithm}
 }
 ```
 For questions, please contact lukas.eveborn@liu.se
 
-### Electric Vehicle Routing Problem with Time  Windows and Piecewise Linear Charging Function
 The instances that we use were introduced by M. Schneider, A. Stenger and D. Goeke *The Electric Vehicle-Routing Problem with Time Windows and Recharging Stations*, and can be found at https://data.mendeley.com/datasets/h3mrm5dhxw/1
 These instances are based on the benchmark instances for the VRP of M.M. Solomon *Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints*.
 
@@ -28,19 +32,23 @@ These instances are based on the benchmark instances for the VRP of M.M. Solomon
 The code that was used in the paper is found in this repository.
 
 To run the solver clone or download the repository. 
-The first time running the code, the following commands are required:\
-mkdir build \
-cd build\
-cmake ..\
-make\
+The first time running the code, the following commands are required:
+```sh
+mkdir build 
+cd build
+cmake ..
+make
 ./evrp ../(path to data file)
+```
 
 This creates a new build directory (mkdir build) and the build-files (cmake ..), and runs the code.
 
-When the build directory and build-files exist, the code can be executed with these commands:\
-cd build\
-make\
+When the build directory and build-files exist, the code can be executed with these commands:
+```sh
+cd build
+make
 ./evrp ../(path to data file)
+```
 
 When the algorithm terminates, the solution (the nodes visited in the shortest path) is printed in the terminal along with some data from the algorithm, such as computational time, number of labels left at the end of the algorithm, number of complete paths found, number of elementary paths among the 100 best paths (when using ng-routes). 
 
@@ -54,7 +62,5 @@ In the folder "data" the charging curves for each data instance in the C100, RC1
 
 The charging function is defined in the funtion: create_problem_graph() of the class ERVP_data_subproblem, and can be changed there.
 
-## Paper
-
 ## Licence  
 The content residing in this repository is licensed under "Creative Commons Zero v1.0 Universal", see [LICENSE](LICENSE).
\ No newline at end of file