Proceedings of the IEEK Conference (대한전자공학회:학술대회논문집)
- 2000.06b
- /
- Pages.213-216
- /
- 2000
A Study on the Mathematical Equivalence and $\varepsilon$ -Relaxation of Auction Algorithm for PCB Design
PCB 설계를 위한 Auction 알고리즘의 수학적 등가와 $\varepsilon$ -이완법에 관한 연구
Abstract
Minimum-cost linear network flow problems could be transformed with equal to assignment problems. Traditional method to solve the linear network flow problems are improved source-cost by transform the simple cycle flow. Auction algorithm could be applied to same element using the initial target price and dispersion calculation. Also, each elements are obtained by
Keywords