Solving the shortest path problem using an analog network

DOI10.1109/81.802826MaRDI QIDQ4505201zbMATH OpenOpenAlexFDO

Authors Linkai Bu, Tzi-Dar Chiueh

Publication date 26 September 2000

Published in IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/81.802826

zbMATH Keywords

shortest pathanalog network

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Recommendations

• A discrete-time recurrent neural network for shortest-path routing
• An analog scheme for fixed-point computation-Part II: Applications
• scientific article; zbMATH DE number 1810469
• Analog circuit for solving assignment problems

Cited in

(2)

• An analog scheme for fixed-point computation-Part II: Applications
• Analog circuit for solving assignment problems

This page was built for publication: Solving the shortest path problem using an analog network

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4505201)