Paul Swoboda, Jan Kuske, Bogdan Savchynskyy. A Dual Ascent Framework for Lagrangean Decomposition of Combinatorial Problems. In 2017 IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2017, Honolulu, HI, USA, July 21-26, 2017. pages 4950-4960, IEEE Computer Society, 2017. [doi]
@inproceedings{SwobodaKS17,
title = {A Dual Ascent Framework for Lagrangean Decomposition of Combinatorial Problems},
author = {Paul Swoboda and Jan Kuske and Bogdan Savchynskyy},
year = {2017},
doi = {10.1109/CVPR.2017.526},
url = {http://doi.ieeecomputersociety.org/10.1109/CVPR.2017.526},
researchr = {https://researchr.org/publication/SwobodaKS17},
cites = {0},
citedby = {0},
pages = {4950-4960},
booktitle = {2017 IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2017, Honolulu, HI, USA, July 21-26, 2017},
publisher = {IEEE Computer Society},
isbn = {978-1-5386-0457-1},
}