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

Authors:
Stephen Beale
Affiliations:
Computing Research Laboratory, New Mexico State University, Las Cruces, New Mexico
Venue:
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Year:
1997

Citing 6
Cited 1

Graphs and algorithms

Graphs and algorithms
Arc and path consistence revisited

Artificial Intelligence
Synthesizing constraint expressions

Communications of the ACM
Graph Algorithms

Graph Algorithms
Nonserial Dynamic Programming

Nonserial Dynamic Programming
Hunter-Gatherer: three search techniques integrated for natural language semantics

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2

Hard, flexible and dynamic constraint satisfaction

The Knowledge Engineering Review

Quantified Score

Hi-index	0.00

Visualization

Abstract

This work integrates three related AI search techniques - constraint satisfaction, branch-and-bound and solution synthesis - and apphes the result to constraint satisfaction problems for which optimal answers are required. This method has already been shown to work well in natural language semantic analysis (Beale, et al, 1996); here we extend the domain to optimizing graph coloring problems, which are abstractions of many common scheduling problems of interest. We demonstrate that the methods used here allow us to determine optimal answers to many types of problems without resorting to heuristic search, and, furthermore can be combined with heuristic search methods for problems with excessive complexity.