Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints (Q5387639): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Precoloring extension. I: Interval graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Using tabu search techniques for graph coloring / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Generalized coloring for tree-like graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2761069 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Generalizing AllDifferent: The SomeDifferent Constraint / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Principles and Practice of Constraint Programming – CP 2003 / rank | |||
Normal rank |
Latest revision as of 09:54, 28 June 2024
scientific article; zbMATH DE number 5279330
Language | Label | Description | Also known as |
---|---|---|---|
English | Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints |
scientific article; zbMATH DE number 5279330 |
Statements
Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints (English)
0 references
27 May 2008
0 references
0 references