- 期刊
- OpenAccess
About One Task of Mixed Integer Programming of Large Dimension and its Solving Algorithm
摘要
One method of solving the mixed-integer task of a special type is offered in this paper, which emerges when solving the task of production placement by a modified method of Benders. The task is solved by the branch and boundary method. Calculative experiments are shown and optimal or close to optimal variants of production placement are gained. The scheme of branching is offered, which is economic if considering the required computer memory. Also, the rules of the rejection process of variants are offered.
延伸閱讀
- Yao, Y. H., & Liou, Y. C. (2010). Composite Algorithms for Minimization over the Solutions of Equilibrium Problems and Fixed Point Problems. Abstract and Applied Analysis, (2010), 1567-1585. https://doi.org/10.1155/2010/763506
- Wang, Y. (2021). Applications of an Improved PSO in Integer Linear Programming. 電腦學刊, 32(6), 98-106. https://doi.org/10.53106/199115992021123206008
- Chen, Y. C. (2010). Efficient Algorithms for the Constrained Longest Common Subsequence Problems [doctoral dissertation, National Taiwan University]. Airiti Library. https://doi.org/10.6342/NTU.2010.02715
- 黃敬庭（2023）。Design of Evolutionary Algorithm for Solving Multimodal Continuous Optimization Problems〔碩士論文，國立臺灣師範大學〕。華藝線上圖書館。https://doi.org/10.6345/NTNU202300305
- Zheng, Y., Yan, Y., Liu, S., Huang, X., & Xu, W. (2012). An Efficient Approach to Solve the Large-Scale Semidefinite Programming Problems. Mathematical Problems in Engineering, 2012(), 556-567-533. https://doi.org/10.1155/2012/764760