Constraint satisfaction problems: algorithms and applications

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.

Production Planning & Control, Usage, Software, Scheduling (Management), Production control, Combinatorial optimization, Mathematical programming, Numerical calculations

---

A linear program for the two-hub location problem

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.

Linear programming

---

Efficient solution procedure and reduced size formulations for p-hub location problems

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.

Research, Algorithms, Integer programming

Similar abstracts:

• Abstracts: Conditional subgradient optimization - theory and applications. On the convergence of conditional epselon-subgradient methods for convex programs and convex-concave saddle-point problems
• Abstracts: Discrete-continuous scheduling problems - mean completion time results. On a methodology for discrete-continuous scheduling
• Abstracts: Probabilistic combinatorial optimization problems on graphs: a new domain in operational research. A generalization of Konig-Egervary graphs and heuristics for the maximum independent set problem with improved approximation ratios
• Abstracts: Beyond the drawing. Creative visualisation. Learning from its mistakes: AutoCAD's Release 14 is faster and easier to use than Release 13, and should also be free of the problems that dogged its predecessor
• Abstracts: Getting the picture: airlines enlarge video screens and expand offerings. Debate on carrier's ratings

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.