Tightness of LP relaxations for almost balanced models

Adrian Weller, Mark Rowland, David Sontag

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish (US)
Title of host publicationPrinciples and Practice of Constraint Programming - 22nd International Conference, CP 2016, Proceedings
PublisherSpringer Verlag
Pages894-895
Number of pages2
Volume9892 LNCS
ISBN (Print)9783319449524
StatePublished - 2016
Event22nd International Conference on Principles and Practice of Constraint Programming, CP 2016 - Toulouse, France
Duration: Sep 5 2016Sep 9 2016

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9892 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other22nd International Conference on Principles and Practice of Constraint Programming, CP 2016
CountryFrance
CityToulouse
Period9/5/169/9/16

Fingerprint

Linear Programming Relaxation
Tightness
Constraint Satisfaction Problem
Linear programming
Binary
Constraint satisfaction problems
Integer
Sufficient Conditions
Model

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Weller, A., Rowland, M., & Sontag, D. (2016). Tightness of LP relaxations for almost balanced models. In Principles and Practice of Constraint Programming - 22nd International Conference, CP 2016, Proceedings (Vol. 9892 LNCS, pp. 894-895). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9892 LNCS). Springer Verlag.

Tightness of LP relaxations for almost balanced models. / Weller, Adrian; Rowland, Mark; Sontag, David.

Principles and Practice of Constraint Programming - 22nd International Conference, CP 2016, Proceedings. Vol. 9892 LNCS Springer Verlag, 2016. p. 894-895 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9892 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Weller, A, Rowland, M & Sontag, D 2016, Tightness of LP relaxations for almost balanced models. in Principles and Practice of Constraint Programming - 22nd International Conference, CP 2016, Proceedings. vol. 9892 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9892 LNCS, Springer Verlag, pp. 894-895, 22nd International Conference on Principles and Practice of Constraint Programming, CP 2016, Toulouse, France, 9/5/16.
Weller A, Rowland M, Sontag D. Tightness of LP relaxations for almost balanced models. In Principles and Practice of Constraint Programming - 22nd International Conference, CP 2016, Proceedings. Vol. 9892 LNCS. Springer Verlag. 2016. p. 894-895. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Weller, Adrian ; Rowland, Mark ; Sontag, David. / Tightness of LP relaxations for almost balanced models. Principles and Practice of Constraint Programming - 22nd International Conference, CP 2016, Proceedings. Vol. 9892 LNCS Springer Verlag, 2016. pp. 894-895 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@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",
year = "2016",
language = "English (US)",
isbn = "9783319449524",
volume = "9892 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "894--895",
booktitle = "Principles and Practice of Constraint Programming - 22nd International Conference, CP 2016, Proceedings",
address = "Germany",

}

TY - GEN

T1 - Tightness of LP relaxations for almost balanced models

AU - Weller, Adrian

AU - Rowland, Mark

AU - Sontag, David

PY - 2016

Y1 - 2016

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84986214998&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84986214998&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84986214998

SN - 9783319449524

VL - 9892 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 894

EP - 895

BT - Principles and Practice of Constraint Programming - 22nd International Conference, CP 2016, Proceedings

PB - Springer Verlag

ER -