Fuji Nakagawa received his BS degree from Himeji Institute of Technology in 1973 and PhD from Kyoto University in 1979. He was a member of the faculty at Takamatsu Technical College from 1980 to 1988, when he was appointed an Assistant Professor a t Okayama Science College. Between 1986 and 1987, he was advisiting research staff memberat Purdue University. He has been working on reliability engineering, integer programming, permutation and search algorithms. He is a member of Society for Information Processing, Japanese Society of Operational Research and IEEE.
Article
A new method for discrete optimization problems
Article first published online: 11 SEP 2007
DOI: 10.1002/ecjc.4430731111
Copyright © 1990 Wiley Periodicals, Inc., A Wiley Company
Issue
1520-6440/asset/cover.gif?v=1&s=5dcbd8b5581795810e209e1f34ba941dd2b64c08 "Electronics and Communications in Japan (Part III: Fundamental Electronic Science)")
Electronics and Communications in Japan (Part III: Fundamental Electronic Science)
Volume 73, Issue 11, pages 99–106, 1990
Additional Information
How to Cite
Nakagawa, Y. (1990), A new method for discrete optimization problems. Electron. Comm. Jpn. Pt. III, 73: 99–106. doi: 10.1002/ecjc.4430731111
Publication History
- Issue published online: 11 SEP 2007
- Article first published online: 11 SEP 2007
- Abstract
- References
- Cited By
Abstract
A generalized optimization system with a discrete decision space, is described, and on an optimization problem is defined which is associated with the system. A new solution method, which is called modular approach (MA), is presented to solve the optimization problem. This method extends the Morin-Marsten hybrid idea to solve troublesome problems of dynamic programming. The present method is also an extension of the branch-and-bound method using breadth-first search.