5 CONSTRAINT SATISFACTION PROBLEMS
5CONSTRAINTSATISFACTIONPROBLEMSInwhich weseehowtreatingstatesasmore thanjustlittleblack boxesleadsto theinventionofa range ofpowerfulnew search methodsanda deeperunderstandingofproblemstructure and4 exploredtheideathatproblemscanbesolvedby searchinginaspaceofstates. Thesestatescanbeevaluatedbydomain-specif icheuristicsandtestedtoseewhetherthey ,however,eachstateis is representedbyanarbi-BLACKBOXtrarydatastr ucturethatcanbeaccessedonlybytheproblem- specificroutines thesuccessorfunction,heuristicfunction, , whosestatesandgoaltestconformtoa standard,structured,andverysimplereprese ntation( ).
PROGRAMMING straints must be linear inequalities forming a convex region. Linear programming problems can be solved in time polynomial in the number of variables. Problems with different types of constraints and objective functions have also been studied—quadratic programming, second-order conic programming, and so on.
Download 5 CONSTRAINT SATISFACTION PROBLEMS
Information
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document: