Lianmin Zhang

Orcid: 0000-0002-8626-1847

According to our database1, Lianmin Zhang authored at least 30 papers between 2010 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Combating fraudulent returns using blockchain technology.
Int. Trans. Oper. Res., November, 2024

Is group-buying price mechanism a good choice in the business-to-business system?
Int. Trans. Oper. Res., May, 2024

Incentive-compatible cost allocations for inventory games with private information.
Oper. Res. Lett., 2024

Distributionally Robust Newsvendor Under Stochastic Dominance with a Feature-Based Application.
Manuf. Serv. Oper. Manag., 2024

Multiportfolio Optimization: A Fairness-Aware Target-Oriented Model.
Manuf. Serv. Oper. Manag., 2024

FAST-CA: Fusion-based Adaptive Spatial-Temporal Learning with Coupled Attention for airport network delay propagation prediction.
Inf. Fusion, 2024

Financial support to a supplier for quality improvement in a dual-channel supply chain.
Comput. Ind. Eng., 2024

2023
Learning-based JNCD prediction for quality-wise perceptual quantization in HEVC.
J. Vis. Commun. Image Represent., September, 2023

Who is better off by selling extended warranties in the supply chain: the manufacturer, the retailer, or both?
Ann. Oper. Res., September, 2023

Demand forecasts with judgement bias in a newsvendor problem.
Int. J. Prod. Res., August, 2023

Population monotonic allocation schemes for the two-period economic lot-sizing games.
Oper. Res. Lett., May, 2023

Price optimization under the extended nested logit model.
Oper. Res. Lett., January, 2023

The Inventory Routing Problem Under Uncertainty.
Oper. Res., January, 2023

2022
Optimal group-buying price strategy considering the information-sharing of the seller and buyers in social e-commerce.
Int. Trans. Oper. Res., 2022

Balancing the profit and capacity under uncertainties: a target-based distributionally robust knapsack problem.
Int. Trans. Oper. Res., 2022

A target-based distributionally robust model for the parallel machine scheduling problem.
Int. J. Prod. Res., 2022

Target-based distributionally robust optimization for single machine scheduling.
Eur. J. Oper. Res., 2022

Managing product upgrades and rollover under demand uncertainty.
Comput. Ind. Eng., 2022

2021
Revenue sharing for resource transfer among projects.
Comput. Oper. Res., 2021

Target-based project crashing problem by adaptive distributionally robust optimization.
Comput. Ind. Eng., 2021

Revenue sharing for resource reallocation among project activity contractors.
Ann. Oper. Res., 2021

2020
Keep it or give back? Optimal pricing strategy of reward-based crowdfunding with a hybrid mechanism in the sharing economy.
Int. J. Prod. Res., 2020

Heterogeneous suppliers' contract design in assembly systems with asymmetric information.
Eur. J. Oper. Res., 2020

Optimal Purchasing Policy for Fresh Products from Multiple Supply Sources with Considerations of Random Delivery Times, Risk, and Information.
Decis. Sci., 2020

2019
Push or Pull? Perishable Products with Freshness-Keeping Effort.
Asia Pac. J. Oper. Res., 2019

2018
Stochastic single-machine scheduling with random resource arrival times.
Int. J. Mach. Learn. Cybern., 2018

2017
A Higher-order interactive hidden Markov model and its applications.
OR Spectr., 2017

Some Tree-book Ramsey Numbers.
Ars Comb., 2017

2013
Scheduling under uncertainties: on-line algorithms, cooperative games, and manufacturing outsourcing.
PhD thesis, 2013

2010
The Ramsey numbers for cycles versus wheels of even order.
Eur. J. Comb., 2010


  Loading...