NEWS & ACHIEVEMENTS
近期新闻 · 创新实践
实验室竞赛获奖、论文发表与人才培养的动态记录。每一行都是一次把模型写到领奖台上的证明。
01 — PRACTICE
创新实践 · 竞赛与荣誉
02 — PAPERS
研究成果 · 期刊论文
A branch-and-price-and-cut algorithm for the cable routing problem in solar power plants.
Zhixing Luo, Hu Qin, T.C. Cheng, Qinghua Hu and Andrew Lim
INFORMS Journal on Computing · accepted, 2020
A Benders decomposition approach for the multi-vehicle production routing problem.
Zhenzhen Zhang, Zhixing Luo*, Roberto Baldacci and Andrew Lim
Transportation Science · accepted, 2020
A new branch-and-price-and-cut algorithm for one-dimensional bin packing problems.
Lijun Wei, Zhixing Luo*, Roberto Baldacci and Andrew Lim
INFORMS Journal on Computing · 32 (2), 428-443, 2020
An ascending auction for freight forwarders’ collaboration in capacity sharing.
Minghui Lai, Weili Xue, and Qian Hu
Transportation Science · 2019, 53(4): 1175-1195
An effective evolutionary algorithm for the biobjective full truckload transportation service procurement problem.
Mo Zhang, Qian Hu*
Computers & Industrial Engineering · 2019, 127: 1012-1023
Exact Algorithms for the Vehicle Routing Problem with Time Windows and Combinatorial Auction.
Zhenzhen Zhang, Zhixing Luo*, Hu Qin and Andrew Lim
Transportation Science · 53 (2), 427-441, 2019
A two-phase branch-and-price-and-cut for a dial-a-ride problem in patient transportation.
Zhixing Luo*, Mengyang Liu and Andrew Lim
Transportation Science · 53 (1), 113-130, 2019
A branch-and-price algorithm for scheduling of deteriorating jobs and flexible periodic maintenance on a single machine.
Ting Wang, Roberto Baldacci, Andrew Lim, Qian Hu*
European Journal of Operational Research · 2018, 271 (3): 826-838
A best-fit branch-and-bound algorithm for the unconstrained two-dimensional non-guillotine cutting problem.
Lijun Wei, Qian Hu*, Andrew Lim, Qiang Liu
European Journal of Operational Research · 2018, 270 (2): 448-474
The two-dimensional vector packing problem with general costs.
Qian Hu, Lijun Wei, Andrew Lim
Omega — International Journal of Management Science · 2018, 74: 59-69