Polyhedral study for the maximum bounded r-tree problem

Hervé Kerivin, Jinhua Zhao. Polyhedral study for the maximum bounded r-tree problem. In International Conference on Control, Decision and Information Technologies, CoDIT 2014, Metz, France, November 3-5, 2014. pages 140-145, IEEE, 2014. [doi]

@inproceedings{KerivinZ14,
  title = {Polyhedral study for the maximum bounded r-tree problem},
  author = {Hervé Kerivin and Jinhua Zhao},
  year = {2014},
  doi = {10.1109/CoDIT.2014.6996883},
  url = {http://dx.doi.org/10.1109/CoDIT.2014.6996883},
  researchr = {https://researchr.org/publication/KerivinZ14},
  cites = {0},
  citedby = {0},
  pages = {140-145},
  booktitle = {International Conference on Control, Decision and Information Technologies, CoDIT 2014, Metz, France, November 3-5, 2014},
  publisher = {IEEE},
  isbn = {978-1-4799-6773-5},
}