Exact and approximate discrete optimization algorithms for finding useful disjunctions of categorical predicates in data analysis

Endre Boros, Vladimir Menkov. Exact and approximate discrete optimization algorithms for finding useful disjunctions of categorical predicates in data analysis. Discrete Applied Mathematics, 144(1-2):43-58, 2004. [doi]

@article{BorosM04,
  title = {Exact and approximate discrete optimization algorithms for finding useful disjunctions of categorical predicates in data analysis},
  author = {Endre Boros and Vladimir Menkov},
  year = {2004},
  doi = {10.1016/j.dam.2004.06.006},
  url = {http://dx.doi.org/10.1016/j.dam.2004.06.006},
  tags = {optimization, analysis, data-flow analysis},
  researchr = {https://researchr.org/publication/BorosM04},
  cites = {0},
  citedby = {0},
  journal = {Discrete Applied Mathematics},
  volume = {144},
  number = {1-2},
  pages = {43-58},
}