A reoptimization algorithm for the shortest path problem with time windows. (English)
Eur. J. Oper. Res. 35, No.2, 242-254 (1988).
1
Constructing submodule specifications and network protocols. (English)
IEEE Trans. Softw. Eng. 14, No.11, 1565-1577 (1988).
2
Maximum-weight markings in marked graphs: Algorithms and interpretations based on the simplex method. (English)
IEEE Trans. Circuits Syst. 34, 1535-1545 (1987).
3
Diagnosing infeasibility in min-cost network flow problems. I: Dual infeasibility. (English)
IMA J. Math. Manage. 1, No.2, 99-109 (1987).
4
Some new results on a restricted channel routing problem. (English)
VLSI algorithms and architectures, Proc. Aegean Workshop Comput., Loutraki/Greece 1986, Lect. Notes Comput. Sci. 227, 133-143 (1986).
5
Breaking symmetry in synchronous networks. (English)
VLSI algorithms and architectures, Proc. Aegean Workshop Comput., Loutraki/Greece 1986, Lect. Notes Comput. Sci. 227, 26-33 (1986).
6
Computer networks. Adaptiveness, noise stability, reliability. (Vychislitel’nye seti. Adaptivnost’, pomekhoustojchivost’, nadezhnost’). (Russian)
Moskva: Izdatel’stvo "Nauka". 280 p. R. 2.00 (1981).
7
Start
Contact
Print
General Help
