Resolving Infeasibility in Linear Programs for the Frequent Itemset Hiding Problem

Panteleimon Krasadakis, Vassilios S. Verykios, Evangelos Sakkopoulos. Resolving Infeasibility in Linear Programs for the Frequent Itemset Hiding Problem. In 33rd IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2021, Washington, DC, USA, November 1-3, 2021. pages 1067-1074, IEEE, 2021. [doi]

@inproceedings{KrasadakisVS21,
  title = {Resolving Infeasibility in Linear Programs for the Frequent Itemset Hiding Problem},
  author = {Panteleimon Krasadakis and Vassilios S. Verykios and Evangelos Sakkopoulos},
  year = {2021},
  doi = {10.1109/ICTAI52525.2021.00169},
  url = {https://doi.org/10.1109/ICTAI52525.2021.00169},
  researchr = {https://researchr.org/publication/KrasadakisVS21},
  cites = {0},
  citedby = {0},
  pages = {1067-1074},
  booktitle = {33rd IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2021, Washington, DC, USA, November 1-3, 2021},
  publisher = {IEEE},
  isbn = {978-1-6654-0898-1},
}