Improving Linear Programming Approaches for the Steiner Tree Problem. Althaus, E., Polzin, T., & Daneshmand, S. V. In Jansen, K., Margraf, M., Mastrolilli, M., & Rolim, J. D. P., editors, WEA, volume 2647, of Lecture Notes in Computer Science, pages 1-14, 2003. Springer. ![Improving Linear Programming Approaches for the Steiner Tree Problem. [link]](https://bibbase.org/img/filetypes/link.svg "link")
Link Paper bibtex @inproceedings{conf/wea/AlthausPD03,
added-at = {2017-05-17T00:00:00.000+0200},
author = {Althaus, Ernst and Polzin, Tobias and Daneshmand, Siavash Vahdati},
biburl = {https://www.bibsonomy.org/bibtex/28a1c92f968709f7e8a1e30b07df28774/dblp},
booktitle = {WEA},
crossref = {conf/wea/2003},
editor = {Jansen, Klaus and Margraf, Marian and Mastrolilli, Monaldo and Rolim, José D. P.},
ee = {https://doi.org/10.1007/3-540-44867-5_1},
interhash = {4efdc22f9043188699165c079ef55631},
intrahash = {8a1c92f968709f7e8a1e30b07df28774},
isbn = {3-540-40205-5},
keywords = {dblp},
pages = {1-14},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
timestamp = {2019-05-15T13:16:04.000+0200},
title = {Improving Linear Programming Approaches for the Steiner Tree Problem.},
url = {http://dblp.uni-trier.de/db/conf/wea/wea2003.html#AlthausPD03},
volume = 2647,
year = 2003
}
Downloads: 0
{"_id":"kbQcgvZxTFveboRPP","bibbaseid":"althaus-polzin-daneshmand-improvinglinearprogrammingapproachesforthesteinertreeproblem-2003","author_short":["Althaus, E.","Polzin, T.","Daneshmand, S. V."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","added-at":"2017-05-17T00:00:00.000+0200","author":[{"propositions":[],"lastnames":["Althaus"],"firstnames":["Ernst"],"suffixes":[]},{"propositions":[],"lastnames":["Polzin"],"firstnames":["Tobias"],"suffixes":[]},{"propositions":[],"lastnames":["Daneshmand"],"firstnames":["Siavash","Vahdati"],"suffixes":[]}],"biburl":"https://www.bibsonomy.org/bibtex/28a1c92f968709f7e8a1e30b07df28774/dblp","booktitle":"WEA","crossref":"conf/wea/2003","editor":[{"propositions":[],"lastnames":["Jansen"],"firstnames":["Klaus"],"suffixes":[]},{"propositions":[],"lastnames":["Margraf"],"firstnames":["Marian"],"suffixes":[]},{"propositions":[],"lastnames":["Mastrolilli"],"firstnames":["Monaldo"],"suffixes":[]},{"propositions":[],"lastnames":["Rolim"],"firstnames":["José","D.","P."],"suffixes":[]}],"ee":"https://doi.org/10.1007/3-540-44867-5_1","interhash":"4efdc22f9043188699165c079ef55631","intrahash":"8a1c92f968709f7e8a1e30b07df28774","isbn":"3-540-40205-5","keywords":"dblp","pages":"1-14","publisher":"Springer","series":"Lecture Notes in Computer Science","timestamp":"2019-05-15T13:16:04.000+0200","title":"Improving Linear Programming Approaches for the Steiner Tree Problem.","url":"http://dblp.uni-trier.de/db/conf/wea/wea2003.html#AlthausPD03","volume":"2647","year":"2003","bibtex":"@inproceedings{conf/wea/AlthausPD03,\n added-at = {2017-05-17T00:00:00.000+0200},\n author = {Althaus, Ernst and Polzin, Tobias and Daneshmand, Siavash Vahdati},\n biburl = {https://www.bibsonomy.org/bibtex/28a1c92f968709f7e8a1e30b07df28774/dblp},\n booktitle = {WEA},\n crossref = {conf/wea/2003},\n editor = {Jansen, Klaus and Margraf, Marian and Mastrolilli, Monaldo and Rolim, José D. P.},\n ee = {https://doi.org/10.1007/3-540-44867-5_1},\n interhash = {4efdc22f9043188699165c079ef55631},\n intrahash = {8a1c92f968709f7e8a1e30b07df28774},\n isbn = {3-540-40205-5},\n keywords = {dblp},\n pages = {1-14},\n publisher = {Springer},\n series = {Lecture Notes in Computer Science},\n timestamp = {2019-05-15T13:16:04.000+0200},\n title = {Improving Linear Programming Approaches for the Steiner Tree Problem.},\n url = {http://dblp.uni-trier.de/db/conf/wea/wea2003.html#AlthausPD03},\n volume = 2647,\n year = 2003\n}\n\n","author_short":["Althaus, E.","Polzin, T.","Daneshmand, S. V."],"editor_short":["Jansen, K.","Margraf, M.","Mastrolilli, M.","Rolim, J. D. P."],"key":"conf/wea/AlthausPD03","id":"conf/wea/AlthausPD03","bibbaseid":"althaus-polzin-daneshmand-improvinglinearprogrammingapproachesforthesteinertreeproblem-2003","role":"author","urls":{"Link":"https://doi.org/10.1007/3-540-44867-5_1","Paper":"http://dblp.uni-trier.de/db/conf/wea/wea2003.html#AlthausPD03"},"keyword":["dblp"],"metadata":{"authorlinks":{}},"html":""},"bibtype":"inproceedings","biburl":"http://www.bibsonomy.org/bib/author/polzin?items=1000","dataSources":["L92qcuQyWy6p4hiBM"],"keywords":["dblp"],"search_terms":["improving","linear","programming","approaches","steiner","tree","problem","althaus","polzin","daneshmand"],"title":"Improving Linear Programming Approaches for the Steiner Tree Problem.","year":2003}