engleski

Optimal location problems solved with graph theory

Finding optimal solution in many problems is motivating with possible time, resource and money savings. When problem becomes very large, the main task is how to organize the optimal solution achievement in an optimal way. Graph theory and the search tree with appropriate branch and bound rules are helpful. In this paper we propose a way of solving multi-dimensional optimal location problems. We describe the software developed for such problems based on given theoretical logic and created on database relations. The theory and software are connected in optimal way to make solving even large problems easier and faster. Our choice is a contribution to SLP(Simple Location Problems) and it is based on our work concerning different operations research problems and programming languages.

graph theory; simple location problem (SLP); database relations

nije evidentirano