Abstract
AbstractThe notion of an „exact”︁ test for improving network solutions is discussed. Computational results are presented which indicate the power of „exact”︁ tests relative to current marginal pricing schemes. It is conjectured that each cycle in an optimal solution must contain at least \documentclass{article}\pagestyle{empty}\begin{document}$ 1 + \frac{1}{{1^\alpha - 1}} $\end{document} links, where the cost of a link of length l and capacity y is proportional to 1·yα, 0 ≦ α ≦ 1.A simple „exact”︁ test is presented for the one termianl TELPAK problem.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
