מאמרים עם הרשאות לגישה ציבורית - Andrew Limלמידע נוסף
לא זמינים באתר כלשהו: 46
A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints
L Wei, Z Zhang, D Zhang, A Lim
European Journal of Operational Research 243 (3), 798-814, 2015
הרשאות: National Natural Science Foundation of China
A memetic algorithm for the patient transportation problem
Z Zhang, M Liu, A Lim
Omega 54, 60-71, 2015
הרשאות: Research Grants Council, Hong Kong
A branch-and-cut algorithm for a realistic dial-a-ride problem
M Liu, Z Luo, A Lim
Transportation Research Part B: Methodological 81, 267-288, 2015
הרשאות: Research Grants Council, Hong Kong
An evolutionary local search for the capacitated vehicle routing problem minimizing fuel consumption under three-dimensional loading constraints
Z Zhang, L Wei, A Lim
Transportation Research Part B: Methodological 82, 20-35, 2015
הרשאות: National Natural Science Foundation of China
Pickup and delivery service with manpower planning in Hong Kong public hospitals
A Lim, Z Zhang, H Qin
Transportation Science 51 (2), 688-705, 2017
הרשאות: National Natural Science Foundation of China, Research Grants Council, Hong …
Optimal pricing decisions for an omni‐channel supply chain with retail service
Y Jiang, L Liu, A Lim
International Transactions in Operational Research 27 (6), 2927-2948, 2020
הרשאות: National Research Foundation, Singapore
Branch and price and cut for the split-delivery vehicle routing problem with time windows and linear weight-related cost
Z Luo, H Qin, W Zhu, A Lim
Transportation Science 51 (2), 668-687, 2017
הרשאות: National Natural Science Foundation of China
A greedy aggregation–decomposition method for intermittent demand forecasting in fashion retailing
C Li, A Lim
European Journal of Operational Research 269 (3), 860-869, 2018
הרשאות: National Research Foundation, Singapore
On service consistency in multi-period vehicle routing
Z Luo, H Qin, CH Che, A Lim
European Journal of Operational Research 243 (3), 731-744, 2015
הרשאות: National Natural Science Foundation of China
A new branch-and-price-and-cut algorithm for one-dimensional bin-packing problems
L Wei, Z Luo, R Baldacci, A Lim
INFORMS Journal on Computing 32 (2), 428-443, 2020
הרשאות: National Natural Science Foundation of China, National Research Foundation …
A branch-and-price algorithm for scheduling of deteriorating jobs and flexible periodic maintenance on a single machine
T Wang, R Baldacci, A Lim, Q Hu
European Journal of Operational Research 271 (3), 826-838, 2018
הרשאות: National Natural Science Foundation of China, National Research Foundation …
A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints
T Liu, Z Luo, H Qin, A Lim
European Journal of Operational Research 266 (2), 487-497, 2018
הרשאות: National Natural Science Foundation of China, National Research Foundation …
A two-phase branch-and-price-and-cut for a dial-a-ride problem in patient transportation
AL Z. Luo, M. Liu
Transportation Science 53 (1), 113-130, 2019
הרשאות: National Natural Science Foundation of China
Machine scheduling with orientation selection and two-dimensional packing for additive manufacturing
Y Che, K Hu, Z Zhang, A Lim
Computers & Operations Research 130, 105245, 2021
הרשאות: National Natural Science Foundation of China, National Research Foundation …
Multi-commodity demand fulfillment via simultaneous pickup and delivery for a fast fashion retailer
Z Zhang, B Cheang, C Li, A Lim
Computers & Operations Research 103, 81-96, 2019
הרשאות: National Natural Science Foundation of China, National Research Foundation …
A last-mile drone-assisted one-to-one pickup and delivery problem with multi-visit drone trips
Z Luo, R Gu, M Poon, Z Liu, A Lim
Computers & Operations Research 148, 106015, 2022
הרשאות: National Natural Science Foundation of China
The multiple container loading problem with preference
T Tian, W Zhu, A Lim, L Wei
European Journal of Operational Research 248 (1), 84-94, 2016
הרשאות: National Natural Science Foundation of China
Digital coupon promotion and platform selection in the presence of delivery effort
Y Jiang, F Liu, A Lim
Journal of Retailing and Consumer Services 62, 102612, 2021
הרשאות: National Natural Science Foundation of China
A branch-and-price-and-cut algorithm for a pickup and delivery problem in retailing
C Li, L Gong, Z Luo, A Lim
Omega 89, 71-91, 2019
הרשאות: National Natural Science Foundation of China, National Research Foundation …
An exact algorithm for the unidirectional quay crane scheduling problem with vessel stability
D Sun, L Tang, R Baldacci, A Lim
European Journal of Operational Research 291 (1), 271-283, 2021
הרשאות: National Natural Science Foundation of China
המידע על הפרסום ועל הגורמים המממנים נקבע באופן אוטומטי על ידי תוכנת מחשב