Pages that link to "Item:Q1306379"

The following pages link to The partial constraint satisfaction problem: Facets and lifting theorems (Q1306379):

Displaying 12 items.

• Combining VNS with constraint programming for solving anytime optimization problems (Q932188) (← links)
• Soft arc consistency revisited (Q969527) (← links)
• A study of the quadratic semi-assignment polytope (Q1013294) (← links)
• Minimization of locally defined submodular functions by optimal soft arc consistency (Q1020491) (← links)
• Erratum to ``Comparison of column generation models for channel assignment in cellular networks'' (Q1602699) (← links)
• Generalized network design problems. (Q1810478) (← links)
• An improved algorithm to determine lower bounds for the fixed spectrum frequency assignment problem (Q1877917) (← links)
• (Q2741347) (← links)
• Generalized network design polyhedra (Q3100692) (← links)
• Lifting Bell inequalities (Q3438456) (← links)
• A variable neighborhood search algorithm to generate piano fingerings for polyphonic sheet music (Q5278226) (← links)
• A genetic algorithm for the partial binary constraint satisfaction problem: an application to a frequency assignment problem (Q5422011) (← links)