Pruning and branching methods for designing optimal networks by the branch-and-bound method
By: [by] Tomoyasu Nakagawa, Hung Chi Lai [and] Saburo Muroga.
Contributors: Lai, Hung-Chi, joint author.; Muroga, Saburo, joint author.
Series: University of Illinois. Dept. of Computer Science. Report no. 471
Publisher: Dept. of Computer Science, University of Illinois
Published: 1971
Place of publication: Urbana
Language: eng
Number of pages: 59
Subjects: Switching theory.; Branch and bound algorithms.
Notes: Includes bibliographical references.