Using branch-and-bound with constraint satisfaction in optimization problems

Proceedings of the National Conference on Artificial Intelligence

Volumn , Issue , 1997, Pages 209-214

  Beale, Stephen ^a  

^a NEW MEXICO STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; HEURISTIC METHODS; NATURAL LANGUAGE PROCESSING SYSTEMS; OPTIMIZATION; PROBLEM SOLVING;

BRANCH AND BOUND; CONSTRAINT SATISFACTION PROBLEM; HEURISTIC SEARCH; NATURAL LANGUAGE SEMANTIC ANALYSIS;

CONSTRAINT THEORY;

EID: 0031385383     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (10)