MPI-I-2003-1-004. March 2003, 19 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry
Abstract in LaTeX format:
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.
Acknowledgement:
Categories / Keywords: Steiner problem; Lower Bounds; Linear Programming; Local Cuts
References to related material:
To download this research report, please select the type of document that fits best your needs. | Attachement Size(s): |
---|---|
359 KBytes | |
Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView |