The partial constraint satisfaction problem: Facets and lifting theorems

DOI10.1016/S0167-6377(98)00043-1zbMath0957.90095OpenAlexW2144306116MaRDI QIDQ1306379

Antoon W. J. Kolen, Arie M. C. A. Koster, Stan P. M. van Hoesel

Publication date: 1998

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6377(98)00043-1

zbMATH Keywords

integer programmingliftingconstraint satisfactionfacets

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items

A variable neighborhood search algorithm to generate piano fingerings for polyphonic sheet music, An improved algorithm to determine lower bounds for the fixed spectrum frequency assignment problem, Unnamed Item, Combining VNS with constraint programming for solving anytime optimization problems, A genetic algorithm for the partial binary constraint satisfaction problem: an application to a frequency assignment problem, Soft arc consistency revisited, Comparison of column generation models for channel assignment in cellular networks, Models and solution techniques for frequency assignment problems, A study of the quadratic semi-assignment polytope, Generalized network design problems., Minimization of locally defined submodular functions by optimal soft arc consistency, Generalized network design polyhedra, The Power of Linear Programming for General-Valued CSPs, Unnamed Item, Lifting Bell inequalities, Erratum to ``Comparison of column generation models for channel assignment in cellular networks

Cites Work

• Unnamed Item
• The Boolean quadratic polytope: Some characteristics, facets and relatives
• Some simplified NP-complete graph problems
• Transitive packing