|
Description: |
In this talk we describe two problems that combine the determination of a route between two given nodes in a network and the location of a set of special nodes along the route, the minimum cost path problem with relays and the pipeline and valve location problem. It is shown that rather than adding an extra goal to the determination of an optimal path, the selection of nodes with particular properties in such problems works like an additional constraint on the feasible solutions. Formulations for both problems are analysed, and different approaches for solving them are discussed.
|
