论文信息 - A new method for discrete optimization problems

A new method for discrete optimization problems

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.

Yuji Nakagawa

[1] Toshihide Ibaraki,et al. The Power of Dominance Relations in Branch-and-Bound Algorithms , 1977, JACM.

[2] Yuji Nakagawa,et al. Optimal Reliability Allocation by Branch-and-Bound Technique , 1978, IEEE Transactions on Reliability.

[3] A. M. Geoffrion,et al. Integer Programming Algorithms: A Framework and State-of-the-Art Survey , 1972 .

[4] Thomas L. Morin,et al. Branch-and-Bound Strategies for Dynamic Programming , 2015, Oper. Res..

[5] Thomas L. Morin,et al. A hybrid approach to discrete mathematical programming , 2015, Math. Program..

[6] Kenneth Steiglitz,et al. Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation Problems , 1974, JACM.