@inproceedings{161eb1951d2a4daf8ad270aa0b4da420,
title = "Tightness of LP relaxations for almost balanced models",
abstract = "We examine Boolean binary weighted constraint satisfaction problems and derive sufficient conditions for when certain linear programming (LP) relaxations are guaranteed to return an integer solution, in which case the solution is exact and we say that the relaxation is tight.",
author = "Adrian Weller and Mark Rowland and David Sontag",
note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2016.; 22nd International Conference on Principles and Practice of Constraint Programming, CP 2016 ; Conference date: 05-09-2016 Through 09-09-2016",
year = "2016",
language = "English (US)",
isbn = "9783319449524",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "894--895",
editor = "Michel Rueher",
booktitle = "Principles and Practice of Constraint Programming - 22nd International Conference, CP 2016, Proceedings",
}