スポンサーリンク
Department Of Management Engineering | 論文
- A Branch and Bound Algorithm for Precedence Constrained Knapsack Problem
- New Expansion on Marketing Theory by Invention of Information Technology(ABSTRACTS OF PROCEEDINGS OF THE SCHOOL OF INFORMATION TECHNOLOGY AND ELECTRONICS SERIES J TOKAI UNIVERSITY -2003-2004-)
- An Approximate Algorithm for the Resource Constrained Grouping Problem Based on the Lagrangian Relaxation Method