Year: 2018
CAM-Net Digest, Vol. 15 (2018), Iss. 17 : p. 13
Abstract
https://link.springer.com/journal/40305/6/3/page/1
Yurii Nesterov, Vladimir Shikhman
Computation of Fisher–Gale Equilibrium by Auction
J. Oper. Res. Soc. China 6 (3), 349-389 (2018)
https://doi.org/10.1007/s40305-018-0195-5
Shuang Cai, Ke Yang, Ke Liu
Multi-objective Optimization of the Distributed Permutation Flow Shop Scheduling Problem
with Transportation and Eligibility Constraints
J. Oper. Res. Soc. China 6 (3), 391-416 (2018)
https://doi.org/10.1007/s40305-017-0165-3
Jian-Chao Huang, Jin-Yan Fan
Global Complexity Bound of the Inexact Levenberg–Marquardt Method
J. Oper. Res. Soc. China 6 (3), 417-428 (2018)
https://doi.org/10.1007/s40305-017-0184-0
Hong-Bin Yu, Wei-Jia Zeng, Dong-Hua Wu
A Stochastic Level-Value Estimation Method for Global Optimization
J. Oper. Res. Soc. China 6 (3), 429-444 (2018)
https://doi.org/10.1007/s40305-017-0175-1
Yun-Da Dong, Hai-Bin Zhang, Huan Gao
On Globally Q-Linear Convergence of a Splitting Method for Group Lasso
J. Oper. Res. Soc. China 6 (3), 445-454 (2018)
https://doi.org/10.1007/s40305-017-0176-0
Wen-Hua Li, Xing Chai
Online Scheduling on Bounded Batch Machines to Minimize the Maximum Weighted Completion Time
J. Oper. Res. Soc. China 6 (3), 455-465 (2018)
https://doi.org/10.1007/s40305-017-0179-x
Ricardo Biloti, João Daniel Palma Ramos, Jin-Yun Yuan
Spectral Properties and Optimality for Elementary Matrices
J. Oper. Res. Soc. China 6 (3), 467-472 (2018)
https://doi.org/10.1007/s40305-017-0177-z
Ling-Fa Lu, Li-Qi Zhang
Competitive Project Scheduling on Two Unbounded Parallel Batch Machines
J. Oper. Res. Soc. China 6 (3), 473-483 (2018)
https://doi.org/10.1007/s40305-017-0180-4
You do not have full access to this article.
Already a Subscriber? Sign in as an individual or via your institution
Journal Article Details
Publisher Name: Global Science Press
Language: Multiple languages
DOI: https://doi.org/2018-CAM-14168
CAM-Net Digest, Vol. 15 (2018), Iss. 17 : p. 13
Published online: 2018-01
AMS Subject Headings: Global Science Press
Copyright: COPYRIGHT: © Global Science Press
Pages: 1