An improved algorithm for L2-Lp minimization problem.
Dongdong Ge, Rongchuan He, Simai He.
Mathematical Programming, 2017.
Approximation Algorithms for Capacitated Perishable Inventory Systems with Positive Lead Times
X. Chao, X. Gong, C. Shi, Chaolin Yang
accepted by Management Science. 2017.
A Non-Cooperative Approach to Cost Allocation in Joint Replenishment.
He, Simai and Sethuraman, Jay and Wang, Xuan and Zhang, Jiawei.
Operations Research, accepted, 2017.
B-trees and Cache-Oblivious B-trees with Different-Sized Atomic Keys.
Michael A. Bender, Roozbeh Ebrahimi, Haodong Hu, and Bradley C. Kuszmaul.
Transactions on Database Systems (TODS), 41(3), 19:1-19:33, August 2016.
Continuous-review (r, nQ) policies for inventory systems with dual delivery modes.
S. X. Zhou, Chaolin Yang(Corresponding author).
Operations Research, 2016.
Strong NP-Hardness Result for Sparse Optimization with Concave Penalty Functions.
Ge, D., Wang, Z., Wang, M., Ye, Y.
International Conference on Machine Learning (ICML), 2017，Accepted
On New Classes of nonnegative symmetric tensors.
Bilian Chen, Simai He, Zhening Li and Shuzhong Zhang.
Siam Journal on Optimization, 27(1), pp. 292-318, 2017.
|Year||Name||Current Status||Education(last degree)|
|2017||Hao Gong||Department of ORFE, Princeton University||Fudan University|
|2017||Yi Ren||Department of IEOR, Columbia University||Fudan University|
|2016||Jiaying Deng||Foster School of Business, University of Washington||Shanghai University of Finance and Economics|
This course starts with a relatively simple treatment of uncertain linear programming, proceeding with a deep analysis of the interconnections between the construction of appropriate uncertainty sets and the classical chance constraints (probabilistic) approach.
Altogether 12 courses focused on heated topics: big data management, data-driven modeling and decision-making, given by prestigious professors graduated from top overseas universities.
In this lecture, we propose a two-stage robust optimization model which takes into account of the laden containers routing as well as the empty container repositioning and define the robustness for this model.