| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
A folding preprocess for the max k-cut problem
|
Fakhimi, Ramin
|
|
|
19 |
5 |
p. 899-917
|
article
|
| 2 |
A generalized combination of parallel machine scheduling and path
|
Ding, Honglin
|
|
|
19 |
5 |
p. 985-1005
|
article
|
| 3 |
An approximation algorithm for the k-prize-collecting hitting set problem
|
Liu, Qin
|
|
|
19 |
5 |
p. 1007-1016
|
article
|
| 4 |
An optimization approach to coalition formation in centralized EOQ problems with additive transportation costs
|
Saavedra-Nieves, Alejandro
|
|
|
19 |
5 |
p. 1033-1052
|
article
|
| 5 |
A projected fixed point method for a class of vertical tensor complementarity problems
|
Wu, Shi-Liang
|
|
|
19 |
5 |
p. 969-984
|
article
|
| 6 |
Comments on finite termination of the generalized Newton method for absolute value equations
|
Guo, Chun-Hua
|
|
|
19 |
5 |
p. 1017-1026
|
article
|
| 7 |
Convergence rate of projected subgradient method with time-varying step-sizes
|
Zhu, Zhihan
|
|
|
19 |
5 |
p. 1027-1031
|
article
|
| 8 |
Explicit iterative algorithms for solving the split equality problems in Hilbert spaces
|
Tuyen, Truong Minh
|
|
|
19 |
5 |
p. 931-954
|
article
|
| 9 |
On complexity constants of linear and quadratic models for derivative-free trust-region algorithms
|
Schwertner, A. E.
|
|
|
19 |
5 |
p. 919-930
|
article
|
| 10 |
The budgeted maximin share allocation problem
|
Deng, Bin
|
|
|
19 |
5 |
p. 955-968
|
article
|
Journal description