The partial constraint satisfaction problem: Facets and lifting theorems

Authors:
Arie M. C. A. Koster;Stan P. M. Van Hoesel;Antoon W. J. Kolen
Affiliations:
Department of Quantitative Economics, Maastricht University, P.O. Box 616, 6200 MD Maastricht, The Netherlands;Department of Quantitative Economics, Maastricht University, P.O. Box 616, 6200 MD Maastricht, The Netherlands;Department of Quantitative Economics, Maastricht University, P.O. Box 616, 6200 MD Maastricht, The Netherlands
Venue:
Operations Research Letters
Year:
1998

Citing 3
Cited 15

Integer and combinatorial optimization

Integer and combinatorial optimization
The Boolean quadric polytope: some characteristics, facets and relatives

Mathematical Programming: Series A and B
Transitive Packing

Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization

Optimal Solutions for Frequency Assignment Problems via Tree Decomposition

WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Convergent Tree-Reweighted Message Passing for Energy Minimization

IEEE Transactions on Pattern Analysis and Machine Intelligence
A Linear Programming Approach to Max-Sum Problem: A Review

IEEE Transactions on Pattern Analysis and Machine Intelligence
What is decreased by the max-sum arc consistency algorithm?

Proceedings of the 24th international conference on Machine learning
Compilation for compact power-gating controls

ACM Transactions on Design Automation of Electronic Systems (TODAES)
Discriminative Learning of Max-Sum Classifiers

The Journal of Machine Learning Research
Minimization of Locally Defined Submodular Functions by Optimal Soft Arc Consistency

Constraints
Soft arc consistency revisited

Artificial Intelligence
MAP estimation of semi-metric MRFs via hierarchical graph cuts

UAI '09 Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence
Advanced generic neighborhood heuristics for VNS

Engineering Applications of Artificial Intelligence
AS-level source routing for multi-provider connection-oriented services

Computer Networks: The International Journal of Computer and Telecommunications Networking
Norm-product belief propagation: primal-dual message-passing for approximate inference

IEEE Transactions on Information Theory
Improved Moves for Truncated Convex Models

The Journal of Machine Learning Research
A study of the quadratic semi-assignment polytope

Discrete Optimization
The power of linear programming for finite-valued CSPs: a constructive characterization

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I

Quantified Score

Hi-index	0.06

Visualization

Abstract

We study the polyhedral structure of the partial constraint satisfaction problem (PCSP). Among the problems that can be formulated as such are the maximum satisfiability problem and a fairly general model of frequency assignment problems. We present lifting theorems and classes of facet defining inequalities, and we provide preliminary experiments.