Modular Approach for Solving Nonlinear Knapsack Problems (Special Section on Nonlinear Theory and Its Applications)

スポンサーリンク

概要

• 論文の詳細を見る

• This paper develops an algorithm based on the Modular Approach to solve singly constrained separable discrete optimization problems (Nonlinear Knapsack Problems). The Modular Approach uses fathoming and integration techniques repeatedly. The fathoming reduces the decision space of variables. The integration reduces the number of variables in the problem by combining several variables into one variable. Computational experiments for "hard" test problems with up to 1000 variables are provided. Each variable has up to 1000 integer values.

• 社団法人電子情報通信学会の論文
• 1999-09-25

著者

• Iwasaki Akinori

  Information Processing Center Okayama University Of Science

• Iwasaki A

  Information Processing Center Okayama University Of Science

• NAKAGAWA Yuji

  Faculty of Informatics, Kansai University

• Nakagawa Yuji

  Faculty Of Informatics Kansai University

関連論文

• Modular Approach for Solving Nonlinear Knapsack Problems (Special Section on Nonlinear Theory and Its Applications)
• APPROXIMATE METHOD FOR SEPARABLE NONCONVEX PROGRAMS
• (1)A Framework for Search Heuristics(ORにおける数理システムの最適化)(研究部会報告)
• Enumeration Methods for Repeatedly Solving Multidimensional Knapsack Sub-Problems(Algorithm Theory)

スポンサーリンク