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; Muroga, Saburo
Series: Report (University of Illinois at Urbana-Champaign. Dept. of Computer Science) -- no. 471; Report (University of Illinois at Urbana-Champaign. Dept. of Computer Science) -- no. 471
Publisher: Dept. of Computer Science, University of Illinois
Published: 1971
Place of publication: Urbana
Language: eng
Number of pages: 59
Subjects: Branch and bound algorithms; Switching theory
Notes: Includes bibliographical references.