Paul, Alice, Freund, Daniel, Ferber, Aaron, Shmoys, David B., and Williamson, David P. Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems. Retrieved from https://par.nsf.gov/biblio/10201019. Mathematics of Operations Research 45.2 Web. doi:10.1287/moor.2019.1002.

Paul, Alice, Freund, Daniel, Ferber, Aaron, Shmoys, David B., & Williamson, David P. Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems. Mathematics of Operations Research, 45 (2). Retrieved from https://par.nsf.gov/biblio/10201019. https://doi.org/10.1287/moor.2019.1002

Paul, Alice, Freund, Daniel, Ferber, Aaron, Shmoys, David B., and Williamson, David P. "Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems". Mathematics of Operations Research 45 (2). Country unknown/Code not available. https://doi.org/10.1287/moor.2019.1002. https://par.nsf.gov/biblio/10201019.

@article{osti_10201019,
place = {Country unknown/Code not available}, title = {Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems}, url = {https://par.nsf.gov/biblio/10201019}, DOI = {10.1287/moor.2019.1002}, abstractNote = {}, journal = {Mathematics of Operations Research}, volume = {45}, number = {2}, author = {Paul, Alice and Freund, Daniel and Ferber, Aaron and Shmoys, David B. and Williamson, David P.}, editor = {null} }