An Integer Linear Programming Formulation for the Minimum Cardinality Segmentation Problem

Daniele Catanzaro, Céline Engelbeen. An Integer Linear Programming Formulation for the Minimum Cardinality Segmentation Problem. Algorithms, 8(4):999-1020, 2015. [doi]

@article{CatanzaroE15,
  title = {An Integer Linear Programming Formulation for the Minimum Cardinality Segmentation Problem},
  author = {Daniele Catanzaro and Céline Engelbeen},
  year = {2015},
  doi = {10.3390/a8040999},
  url = {http://dx.doi.org/10.3390/a8040999},
  researchr = {https://researchr.org/publication/CatanzaroE15},
  cites = {0},
  citedby = {0},
  journal = {Algorithms},
  volume = {8},
  number = {4},
  pages = {999-1020},
}