대한전자공학회:학술대회논문집 (Proceedings of the IEEK Conference)
- 대한전자공학회 1999년도 하계종합학술대회 논문집
- /
- Pages.337-340
- /
- 1999
Auction 알고리즘의 수학적 등가를 이용한 최단경로에 관한 연구
A Study on the Shortest Path using the Mathematical Equivalence of the Auction Algorithm
초록
At each iteration, the path is either extended by adding a new node, or contracted by deleting its terminal node. When the destination becomes the terminal node of the path, the algorithm terminate. In the process of finding the shortest path to given destination, the algorithm visits other node, there by obtaining a shortest path from the origin to them. We show here that when the auction algorithm is applied to this equivalent program with some special rules for choosing the initial object prices and the person submitting a bid at each iteration, one obtains the generic form of the
키워드