diff --git a/README.md b/README.md
index 921ebe4..227ac7c 100644
--- a/README.md
+++ b/README.md
@@ -20,6 +20,29 @@ For advanced usage, consider the `.RELAX_IV()` function. This features no input
 sanitization and has a more complex interface. It's inputs are advanced
 characteristics of the graph, and it returns a more complete set of results.
 
+# RELAX-IV algorithm and code
+
+The **rrelaxiv** package implements D. P. Bertsekas and P. Tseng's RELAX-IV
+algorithm and code:
+
+- Bersekas, D. P. and Tseng, P., "Relaxation Methods for Minimum Cost ..."
+  Operations Research, vol. 26, 1988, 93-114
+- Bertsekas, D. P., "An Auction/Sequential Shortest Path Algorithm for the
+  Minimum Cost Flow Problem", LIDS Report P-2146, MIT, Nov. 1992
+- Bertsekas, D.P., Linear Network Optimization, MIT Press, 1991
+- Bertsekas, D.P., Network Optimization: Continuous and Discrete Models, Athena
+  Scientific, 1998; <http://web.mit.edu/dimitrib/www/noc.htm>
+
+Bertsekas and Tseng freely permit their software to be used for research
+purposes, but non-research uses, including the use of it to 'satisfy in any part
+commercial delivery requirements to government or industry,' require a special
+agreement with them. By extension, this requirement applies to most any use of R
+functions in the **rrelaxiv** package.
+
+To request permissions not here relayed, contact Professor Bertsekas at
+Laboratory for Information and Decision Systems Massachusetts Institute of
+Technology Cambridge, MA 02139 (617) 253-7267 <dimitrib@mit.edu>
+
 # Installing
 
 This package is unlikely to ever appear on CRAN. Methods to install are below.
diff --git a/RELAX-IV_citation.md b/RELAX-IV_citation.md
deleted file mode 100644
index 47361f2..0000000
--- a/RELAX-IV_citation.md
+++ /dev/null
@@ -1,22 +0,0 @@
-# Reference for RELAX-IV Algorithm
-
-The **rrelaxiv** package implements D. P. Bertsekas and P. Tseng's RELAX-IV
-algorithm and code:
-
-- Bersekas, D. P. and Tseng, P., "Relaxation Methods for Minimum Cost ..."
-  Operations Research, vol. 26, 1988, 93-114
-- Bertsekas, D. P., "An Auction/Sequential Shortest Path Algorithm for the
-  Minimum Cost Flow Problem", LIDS Report P-2146, MIT, Nov. 1992
-- Bertsekas, D.P., Linear Network Optimization, MIT Press, 1991
-- Bertsekas, D.P., Network Optimization: Continuous and Discrete Models, Athena
-  Scientific, 1998; <http://web.mit.edu/dimitrib/www/noc.htm>
-
-Bertsekas and Tseng freely permit their software to be used for research
-purposes, but non-research uses, including the use of it to 'satisfy in any part
-commercial delivery requirements to government or industry,' require a special
-agreement with them. By extension, this requirement applies to most any use of R
-functions in the **rrelaxiv** package.
-
-To request permissions not here relayed, contact Professor Bertsekas at
-Laboratory for Information and Decision Systems Massachusetts Institute of
-Technology Cambridge, MA 02139 (617) 253-7267 <dimitrib@mit.edu>