Journal: Optimization Letters

Volume 19, Issue 5

899 -- 917Ramin Fakhimi, Hamidreza Validi, Illya V. Hicks, Tamás Terlaky, Luis F. Zuluaga. A folding preprocess for the max k-cut problem
919 -- 930Anderson E. Schwertner, F. N. C. Sobral. On complexity constants of linear and quadratic models for derivative-free trust-region algorithms
931 -- 954Truong Minh Tuyen, Nguyen Song Ha. Explicit iterative algorithms for solving the split equality problems in Hilbert spaces
955 -- 968Bin Deng, Weidong Li 0002. The budgeted maximin share allocation problem
969 -- 984Shi-Liang Wu, Mei Long, Cui-Xia Li. A projected fixed point method for a class of vertical tensor complementarity problems
985 -- 1005Honglin Ding. A generalized combination of parallel machine scheduling and path
1007 -- 1016Qin Liu, Bo Hou, Gengsheng Zhang, Wen Liu 0009. An approximation algorithm for the k-prize-collecting hitting set problem
1017 -- 1026Chun-Hua Guo. Comments on finite termination of the generalized Newton method for absolute value equations
1027 -- 1031Zhihan Zhu, Yanhao Zhang, Yong Xia 0002. Convergence rate of projected subgradient method with time-varying step-sizes
1033 -- 1052Alejandro Saavedra-Nieves. An optimization approach to coalition formation in centralized EOQ problems with additive transportation costs