Icke-triviala billigaste väg-ruttningskonflikter - klassificering och sökmetoder
… touse for routing. If we assume that a desired tra?c pattern is given the problem isto ?nd out if it is possible to set the weights so that the desired tra?c pattern is apart of a shortest path graph. In this thesis we assume that it is a unique shortestpath. To search for …