A graph based simplex method for the integer minimum perturbation problem with sum and difference constraints

Alexey Lvov, Fook-Luen Heng. A graph based simplex method for the integer minimum perturbation problem with sum and difference constraints. In David Garrett, John Lach, Charles A. Zukowski, editors, Proceedings of the 14th ACM Great Lakes Symposium on VLSI 2004, Boston, MA, USA, April 26-28, 2004. pages 67-72, ACM, 2004. [doi]

@inproceedings{LvovH04,
  title = {A graph based simplex method for the integer minimum perturbation problem with sum and difference constraints},
  author = {Alexey Lvov and Fook-Luen Heng},
  year = {2004},
  doi = {10.1145/988952.988969},
  url = {http://doi.acm.org/10.1145/988952.988969},
  tags = {constraints, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/LvovH04},
  cites = {0},
  citedby = {0},
  pages = {67-72},
  booktitle = {Proceedings of the 14th ACM Great Lakes Symposium on VLSI 2004, Boston, MA, USA, April 26-28, 2004},
  editor = {David Garrett and John Lach and Charles A. Zukowski},
  publisher = {ACM},
  isbn = {1-58113-853-9},
}