b'@techreport{MPI-I-2003-1-004,'b'\nTITLE = {Improving linear programming approaches for the Steiner tree problem},\nAUTHOR = {Althaus, Ernst and Polzin, Tobias and Daneshmand, Siavash},\nLANGUAGE = {eng},\nNUMBER = {MPI-I-2003-1-004},\nINSTITUTION = {Max-Planck-Institut f{\\"u}r Informatik},\nADDRESS = {Saarbr{\\"u}cken},\nYEAR = {2003},\nDATE = {2003},\nABSTRACT = {We present two theoretically interesting and empirically successful techniques for improving the linear programming approaches, namely graph transformation and local cuts, in the context of the Steiner problem. We show the impact of these techniques on the solution of the largest benchmark instances ever solved.},\nTYPE = {Research Report / Max-Planck-Institut f\xc3\xbcr Informatik},\n}\n'