Hong Yan

Orcid: 0000-0002-0699-5470

Affiliations:
  • Hong Kong Polytechnic University, Department of Management, Hong Kong
  • Carnegie Mellon University, Pittsburgh, PA, USA (PhD)


According to our database1, Hong Yan authored at least 53 papers between 1994 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Optimal Capacity Rationing Policy for a Container Leasing System with Multiple Kinds of Customers and Substitutable Containers.
Manag. Sci., March, 2023

2022
The price of anarchy in closed-loop supply chains.
Int. Trans. Oper. Res., 2022

Coordinating inventory sharing with retailer's return in the consignment contracts.
Int. J. Prod. Res., 2022

2018
Reducing emissions in transportation and inventory management: (<i>R, Q</i>) Policy with considerations of carbon reduction.
Eur. J. Oper. Res., 2018

2017
Delivery efficiency and supplier performance evaluation in China's E-retailing industry.
J. Syst. Sci. Complex., 2017

Bullwhip and anti-bullwhip effects in a supply chain.
Int. J. Prod. Res., 2017

The stochastic lot-sizing problem with quantity discounts.
Comput. Oper. Res., 2017

2016
Scale, congestion, efficiency and effectiveness in e-commerce firms.
Electron. Commer. Res. Appl., 2016

Optimal Remanufacturing and Pricing Strategies Under Name-Your-Own-Price Auctions and Stochastic Demand.
Asia Pac. J. Oper. Res., 2016

2013
Tower-of-sets analysis for the Kise-Ibaraki-Mine algorithm.
Optim. Lett., 2013

2012
Optimal dynamic pricing of inventories with stochastic demand and discounted criterion.
Eur. J. Oper. Res., 2012

2011
Data envelopment analysis classification machine.
Inf. Sci., 2011

Composite Network Data envelopment Analysis Model.
Int. J. Inf. Technol. Decis. Mak., 2011

Network DEA model for supply chain performance evaluation.
Eur. J. Oper. Res., 2011

2010
MMS: An autonomic network-layer foundation for network management.
IEEE J. Sel. Areas Commun., 2010

The data envelopment analysis model with intersection form production possibility set.
J. Syst. Sci. Complex., 2010

A Data envelopment Analysis (DEA) Evaluation Method Based on Sample Decision Making Units.
Int. J. Inf. Technol. Decis. Mak., 2010

An effective transformation in ranking using l<sub>1</sub>-norm in data envelopment analysis.
Appl. Math. Comput., 2010

2009
Bargaining game model in the evaluation of decision making units.
Expert Syst. Appl., 2009

The exact domination number of the generalized Petersen graphs.
Discret. Math., 2009

2008
A bi-objective generalized data envelopment analysis model and point-to-set mapping projection.
Eur. J. Oper. Res., 2008

Proof of a conjecture on k-tuple domination in graphs.
Appl. Math. Lett., 2008

2007
Upper minus total domination in small-degree regular graphs.
Discret. Math., 2007

Tesseract: A 4D Network Control Plane.
Proceedings of the 4th Symposium on Networked Systems Design and Implementation (NSDI 2007), 2007

2006
Discovering Architectures from Running Systems.
IEEE Trans. Software Eng., 2006

Information leak vulnerabilities in SIP implementations.
IEEE Netw., 2006

Towards a framework for network control composition.
Proceedings of the 2006 SIGCOMM Workshop on Internet Network Management, 2006

Data Envelopment Analysis Assessment Machine.
Proceedings of the Workshops Proceedings of the 6th IEEE International Conference on Data Mining (ICDM 2006), 2006

2005
Information transformation in a supply chain: a simulation study.
Comput. Oper. Res., 2005

A clean slate 4D approach to network control and management.
Comput. Commun. Rev., 2005

Multitiered Supply Chain Networks: Multicriteria Decision - Making Under Uncertainty.
Ann. Oper. Res., 2005

Dynamically discovering architectures with DiscoTect.
Proceedings of the 10th European Software Engineering Conference held jointly with 13th ACM SIGSOFT International Symposium on Foundations of Software Engineering, 2005

2004
Congestion and returns to scale in data envelopment analysis.
Eur. J. Oper. Res., 2004

DiscoTect: A System for Discovering Architectures from Running Systems.
Proceedings of the 26th International Conference on Software Engineering (ICSE 2004), 2004

2003
Differential and sensitivity properties of gap functions for vector variational inequalities.
Math. Methods Oper. Res., 2003

A strategic model for supply chain design with logical constraints: formulation and solution.
Comput. Oper. Res., 2003

2002
Modelling the benefits of information sharing-based partnerships in a two-level supply chain.
J. Oper. Res. Soc., 2002

Determining compromise weights for group decision making.
J. Oper. Res. Soc., 2002

A class of convex fuzzy mappings.
Fuzzy Sets Syst., 2002

DEA models for resource reallocation and production input/output estimation.
Eur. J. Oper. Res., 2002

A Relaxation of the Cumulative Constraint.
Proceedings of the Principles and Practice of Constraint Programming, 2002

2001
Representations of the all_different Predicate of Constraint Satisfaction in Integer Programming.
INFORMS J. Comput., 2001

Benefits of information sharing with supply chain partnerships.
Ind. Manag. Data Syst., 2001

2000
A compromise weight for multi-criteria group decision making with individual preference.
J. Oper. Res. Soc., 2000

A game theoretical model of DEA efficiency.
J. Oper. Res. Soc., 2000

Response to Balkhi's response.
J. Oper. Res. Soc., 2000

A Reply to Balkhi.
J. Oper. Res. Soc., 2000

A method of transferring cones of intersection form to cones of sum form and its applications in data envelopment analysis models.
Int. J. Syst. Sci., 2000

The generalized DEA model and the convex cone constrained game.
Eur. J. Oper. Res., 2000

1999
Tight representation of logical constraints as cardinality rules.
Math. Program., 1999

1998
Optimal production stopping and restarting times for an EOQ model with deteriorating items.
J. Oper. Res. Soc., 1998

Finding Postal Carrier Walk Paths in Mixed Graphs.
Comput. Optim. Appl., 1998

1994
Logic cuts for processing networks with fixed charges.
Comput. Oper. Res., 1994


  Loading...