--- Document.title
+++ Document.title
@@ -1,26 +0,0 @@
-Linear Programming in Sage
--- Document.authors
+++ Document.authors
@@ -1,13 +0,0 @@
-Nathann Cohen
--- Document.description
+++ Document.description
@@ -1,324 +0,0 @@
-The Linear Programs, when practically dealing with graphs are a *GREAT* tool. There are many very good solvers around, and they are now available in Sage. This means that using them only takes a couple of lines, and writing an algorithm to solve the matching problem takes about 5 minutes, which is already more than enough.
--- Document.url_concatenation
+++ Document.url_concatenation
@@ -1,39 +0,0 @@
-http://steinertriples.fr/ncohen/tut/LP/