Article Abstract:
Constraint satisfaction problems (CSPs) are combinatorial in nature and their study has largely been undertaken within the artificial intelligence community. A variety of approaches can be used to address CSPs although an efficient algorithm is unlikely to exist for many CSP categories. A study proposes the constraint programming approach, that involves the computer implementation of an algorithm, to solve CSPs within the realm of operations research. Constraint satisfaction approaches are also compared with well known operational research techniques.
User Contributions:
Comment about this article or add new information about this topic:
Article Abstract:
An optimization algorithm was developed to solve the discrete two-hub location problem. A linear program was developed using polynomial time to solve the optimal routes when the two hubs are fixed. The linear program required transforming the quadratic 0-1 integer program of the single allocation problem, and adapting it to show that all extreme points of the polytype defined by the linear program to be integral.
User Contributions:
Comment about this article or add new information about this topic:
Article Abstract:
The shortest path algorithm proves useful in solving multiple allocation problem when p is fixed. A nonub node may be allocated to more than one hub in a multiple allocation problem. Each nonhub node needs to be allocated to exactly one of the p hubs when solving the single allocation problem. Computational results show that the proposed model proided integer solutions.
User Contributions:
Comment about this article or add new information about this topic: