Yurii A. Mezentsev. Binary Cut-and- Branch Method for Solving Linear Programming Problems with Boolean Variables. In Alexandr Kononov, Igor Bykadorov, Oleg Khamisov, Ivan Davydov, Polina Kononova, editors, Supplementary Proceedings of the 9th International Conference on Discrete Optimization and Operations Research and Scientific School (DOOR 2016), Vladivostok, Russia, September 19 - 23, 2016. Volume 1623 of CEUR Workshop Proceedings, pages 72-85, CEUR-WS.org, 2016. [doi]
@inproceedings{Mezentsev16,
title = {Binary Cut-and- Branch Method for Solving Linear Programming Problems with Boolean Variables},
author = {Yurii A. Mezentsev},
year = {2016},
url = {http://ceur-ws.org/Vol-1623/paperco12.pdf},
researchr = {https://researchr.org/publication/Mezentsev16},
cites = {0},
citedby = {0},
pages = {72-85},
booktitle = {Supplementary Proceedings of the 9th International Conference on Discrete Optimization and Operations Research and Scientific School (DOOR 2016), Vladivostok, Russia, September 19 - 23, 2016},
editor = {Alexandr Kononov and Igor Bykadorov and Oleg Khamisov and Ivan Davydov and Polina Kononova},
volume = {1623},
series = {CEUR Workshop Proceedings},
publisher = {CEUR-WS.org},
}