The Hang Seng University of Hong Kong Research Database

Search Publications

Selection From : To :	Result	Action

Sort By :

Category: Book Chapter (1); Book (1); Conference Paper (31); Journal Article (219); Others (6); Refereed Conference Proceedings (4)

Department: E&F (1); M&S (37); COM (24); MGT (2); MKT (4); SCM (104); SCOM (7); ACY (2); COMP (1); EAF (7); M&M (1); MSI (66); PV/VPARO (3); SDSC (3)

Keyword: A-optimality (1); AHP (1); Abstract convergence theorem (1); Accelerated path sampler; Markov chain Monte Carlo; Rao-Blackwellization; Species sampling mixture model; Species sampling model (1); Acceptance–rejection algorithm; Bayesian analysis; General incomplete categorical data; Minorization–maximization algorithm; Mode-sharing method (1); Adaptive neuro-fuzzy inference system (ANFIS) (1); Adaptive weights smoothing (1); Advanced manufacturing technologies (1); Advertising policy (1); Affective design (2); After sale service operation (1); Age of Information (AoI) (1); Air pollution (1); Air quality rank (1); Aircraft sizes (1); Airfreight forwarder (1); Airline crew pairing (1); Algorithm (1); Application in finance (1); Approximate unconditional test (1); Arbitrage pricing theory (1); Artificial Intelligence (1); Artificial neural network (3); Artificial neural network, economic growth, human capital, inequality, machine learning (1); Assembly process (1); Asset allocation (1); Asset-liability management (1); Asymptotic expansion (1); Asymptotic test (2); Auction Theory, Budget constraints, Land Auctions, Bidding Strategy (1); Autonomous aerial vehicles (1); Autonomous agents (1); Autoregressive (AR) model (1); Background modeling; Video surveillance; Principal Component; analysis; Statistical mode (1); Backpropagation algorithm (1); Baggage-limit policy (1); Basic inequality (1); Bass model (1); Bayes-type estimator (1); Bayesian QR, LASSO-penalized priors, Gibbs sampler, Autoregressive error, Regression model MATHEMATICS SUBJECT CLASSIFICATION: 62F15, 62J05, 62J07 (1); Bayesian method (1); Bayesian model (1); Bayesian network (1); Berth allocation (1); Berth allocation problem (1); Berth allocation, quay crane assignment, vessel scheduling, terminal, genetic algorithm (1); Beta–Liouville distribution (1); Big data analytics (1); Biological slippage (1); Bit-plane, Image segmentation (1); Blockchain (2); Blood donation (1); Blood donor (1); Blur of history (1); Bootstrap (3); Brand memory (1); Bus passenger flow statistics (1); Business process re-engineering (1); CART feature selection (2); CO2 emissions (1); COMPUTING AND MATHEMATICS (1); Capacitated lot sizing (1); Capital structure (1); Capital structure; credit ratings; speed of adjustment (1); Carbon emission; Sustainability; Maritime transport; Utility; Fuel consumption (1); Case retrieval (1); Case-based Reasoning (1); Case-based reasoning (2); Category distinguishability (1); Celebrity studies (1); Cell segmentation (1); Censored data (1); Centroid algorithm (1); Cervical cell classification (1); Change-point (1); Chaotic Genetic Algorithms (CGA) (1); China (4); Clauset-Newman-Moore grey modularity maximization algorithm (1); Cloud computing (1); Clustering (1); Clustering algorithms (1); Co-op advertising (1); Cobb–Douglas production efficiency problem (1); Column generation (1); Combination airlines (1); Commodities (1); Communication Efficiency (1); Competitive advantage (1); Competitive algorithm (1); Complete separator (1); Completely random measure; Weighted gamma process; Random partition; Rao-Blackwellization; Markov chain Monte Carlo; Proportional hazard model; Gibbs sampler (1); Component reuse (1); Compound Poisson risk model (1); Compression (1); Compustat, EDGAR, 10-K, Link Table (1); Computer vision (1); Conditional independence (1); Conditional quantile (1); Conditional subgradient method, ε-subgradient method, quasi-convex optimization, convergence analysis (1); Confidence Interval (1); Confidence interval (1); Connectivity (1); Consolidation (1); Constrained MLE (1); Constrained maximum likelihood estimation (1); Container loading (1); Continuous-time investment and consumption problem (1); Continuous-time portfolio choice (1); Controlled mobility, network optimization, road safety, trajectory, vehicular communications (1); Convergence Analysis (1); Convergence Rate (1); Convergence analysis (1); Convergence versus divergence, (1); Convex polyhedron (1); Convolution (1); Coordination of inbound and outbound orders (1); Count data (1); Coupled differential Riccati equations (1); Coupled matrix Riccati differential system (1); Courier service (1); Covariance structure analysis (1); Cox proportional hazards model (1); Cramer–Lundberg model (1); Credit ratings (1); Cross-dock (1); Customer behaviour (1); Customer grouping (1); Customer relationship management (1); DA algorithm (1); Data Augmentation (1); Data analytic (1); Data augmentation (2); Data augmentation algorithm; expectation–maximization algorithm; hypothesis testing; multivariate zero-adjusted Poisson; stochastic representation (1); Decision support (1); Decision support system (2); Decision theory (1); Deep learning (1); Deep reinforcement learning (1); Demand chain management (1); Demand forecast (1); Demand management (1); Diagonal-Parameter Symmetry Model (1); Differential games (1); Dirichlet distribution (3); Disease prediction (1); Distributed Learning (1); Distributed scheduling (1); Distribution (1); Distribution management (1); Donation frequency (1); Donor characteristics (1); Dose-response data (2); Double-sided random process (1); Drug combination study (1); Due date scheduling (1); Dynamic programming (1); Dynamic sales-advertising model (1); Dynamic trading (1); Dynamic vehicle routing (1); E-commerce (2); E-commerce logistics (2); E-commerce logistics, Order arrival prediction, Warehouse postponement applications, Adaptive neuro-fuzzy inference system (ANFIS), Autoregressive (AR) model (1); E-commerce order fulfilment (1); E-fulfilment (1); EM algorithm (12); EM algorithm; MM algorithm; Shortest confidence intervals; Stochastic representation; Zero-truncated discrete models (1); EM algorithm; Poisson item count technique; item count technique; negative binomial item count technique; sensitive questions (1); EM-type algorithms (1); ETAS model (1); Economic Growth (1); Economics model (1); Emission (1); Empirical likelihood (1); Empirical mode decomposition (1); Employee training (1); Encryption (1); Environmental sensor network, genetic algorithm, mapping method, multi-objective optimization, multi-responses Taguchi method (1); Epsilon-Nash equilibrium (1); Equilibrium investment (1); Equilibrium proportional reinsurance (1); Equity-linked death benefits (1); Evolutionary computing (1); Exact conditional test (1); Exact inference (1); Exact power (1); Exact power computation (1); Exact significance level (1); Exact unconditional test (2); Excess-of-loss reinsurance (1); Execution costs (1); Expectation–maximization algorithm; Multivariate zero-adjusted Poisson model; Multivariate zero-truncated Poisson model; Stochastic representation (1); Expert systems (1); Exterior point algorithm (1); Factor model (1); Fandom (1); Fault tolerance (1); Feedback Stackelberg equilibrium (1); Fi (1); Five Confucius Virtues (1); Fixed-point problems (1); Flow theory (1); Fluctuating market environment (1); Flying time variability (1); Food quality (1); Forecasting (2); Fourier-cosine method (1); Fuzzy algorithm (1); Fuzzy association rule mining (2); Fuzzy front end (1); Fuzzy inference system (1); Fuzzy logic (9); Fuzzy set (1); Garment Industry (2); Gas industry (1); Generalized EM algorithm (1); Generalized Gaussian density (1); Generalized censoring mechanism (GCM) (1); Generalized iterative scaling (1); Genetic algorithm (12); Genetic algorithm-based clustering (1); Genetic algorithms (3); Genetic parameters (1); Goodness-of-fit test (1); Gradient Truncation (1); Granger causality (1); Graph algorithm (1); Grouped Dirichlet distribution; (1); Grouped binomial response data (1); Guaranteed minimum death benefits (1); Guided neighborhood search (1); Hashing , Sketching , Dimension reduction , Online learning (1); Heuristic analysis (1); Heuristics (1); Higher moments (1); Homogeneity test (1); Hong Kong (1); Huffman coding (1); Hybrid genetic algorithm (1); Image segmentation (1); Image synthesis (1); Incomplete Data (1); Incomplete categorical data (2); Incomplete data (2); Increasing domain asymptotics (1); Industrial intelligence (1); Industry Structure (1); Infill asymptotics (1); Information Freshness (1); Inspection (1); Integer programming (1); Integration (1); Interactivity (1); Internal Marketing (1); Internet of Things (1); Internet of Things (4); Intertemporal hedging (1); Inventory control (1); Inventory models (1); Inverse lithography (1); Inverted beta loss function (1); Joint Coding (1); Jump points (1); Jump-diffusion process (1); Junzi Organisation (1); K-Means (1); Kernel , Buffer storage , Training , Learning systems , Data mining , Support vector machine classification (1); Knowledge Tracing (1); Knowledge management (1); Knowledge representation (1); LAD with fused lasso (1); Lasso (1); Lateral transshipment (1); Learning efficiency (1); Least absolute deviance (1); Levy subordinator (1); Limit order book (1); Linear and nonlinear constraints (1); Linear price impact (1); Linear programming (1); Linear temporary price impact (1); Live streaming (1); Local adaptation (1); Local polynomial (1); Log-linear models (1); Log-return assumption (1); Logistic industries (1); Logistic regression (1); Logistic regression models (1); Logistics (2); Logistics industries (1); Logistics network (1); Logistics strategy formulation (1); Logistics workflow (2); Longevity risk (1); Lost sales (1); MM Algorithm (1); MRP (1); MTAR adjustment (1); Machine Learning (1); Machine learning (1); Machine learning; Clustering methods; Optimization; Numerical algorithms; Optimal trans- port (1); Maintenance planning, assignment problem, workload fairness, bi-objective optimisation, heuristics (1); Makespan (1); Maritime transport; Ship liner service deployment; Vessel allocation; Yield; Decision support model; Optimisation; Genetic algorithms; Deep neural network (1); Market Analytics and Revenue Management (1); Markov chains (1); Markov jump system (1); Markov switching (1); Markovian jump system (1); Markowitz portfolio (1); Matrix Riccati differential system (1); Matrix rate of convergence (1); Maximum likelihood estimation (2); Maximum likelihood estimation (MLE); Hierarchical model; QR analysis; Autoregressive model (1); Maximum-likelihood estimation (1); Mean and covariance structure (1); Mean bias (1); Metaheuristics (1); Minimum description length (MDL) (1); Missing at random (1); Missing data (1); Mixed reality (1); Mixing rate of a markov chain (1); Moral edge (1); Multi-continuous berth layout (1); Multi-factory production (2); Multi-job optimization (1); Multi-task learning (1); Multi-temperature food distribution (1); Multiple Access (1); Multiple change-points (1); Multiple depots (1); Nash equilibrium (3); Nested Dirichlet distribution (2); Neural network (1); Newton–Raphson algorithm (1); Non-Uniform Quantization (1); Non-ignorable missing mechanism (1); Non-negative sparse optimization, non-negative ℓ1 regularization problems, iterative positive thresholding algorithm, global convergence, linear convergence rate (1); Non-randomized response models (4); Non-smooth optimality conditions (1); Non-zero-sum stochastic differential game (1); Nonlinear least squares problems; Inexact Levenberg–Marquardt method; Lipschitz condition; Local error bound (1); Nonzero-sum stochastic differential game (1); Nursing home (1); Nursing homes (1); Nursing staff (1); O2O retailing (1); OLAP (1); Oil industry (1); Online algorithm (1); Online trading (1); Operation guidelines (1); Operations and Supply Chains (1); Optimal QLB algorithm (1); Optimal allocation (1); Optimal configuration (1); Optimal execution problem (1); Optimal neural network (1); Optimal replenishment rate (1); Optimal stimulation level (1); Optimisation (2); Optimization (2); Order arrival prediction (1); Order fulfilment (1); Order picking (1); Ordinal categories (1); Ordinal probit (1); PSO-SVM (2); Paired Binary Data (1); Paired binary data (1); Pairwise L1 regularization (1); Pairwise likelihood (1); Pairwise mean comparison (1); Pallet loading problem (1); Passenger-cargo allocation (1); Peer-to-peer cloud (1); Perfect/imperfect maintenance (1); Perishable food e-commerce (2); Permanent price impact (1); Pick face (1); Pick-face forward area (1); Piecewise stationary time series (1); Polynomial goal programming (1); Polynomial multiplication algorithm (1); Popular Culture (1); Portfolio choice problem (1); Price distortions (1); Prime block (1); Principal component analysis; dimensionality reduction; image processing; pattern recognition; clustering (1); Probability Distributions (1); Product aesthetics (1); Product design (1); Product diffusion dynamics (1); Product form (1); Product form design (1); Product placement (1); Product placement, prominence, brand memory, qualitative comparative analysis (1); Production and distribution (1); Production planning (1); Production quality (1); Production scheduling (2); Production-inventory system (1); Production/ Inventory (1); Prominence (1); Property management (1); QLB algorithm (1); Quadratic lower-bound (QLB) algorithm (1); Quadratic transaction cost (1); Qualitative comparative analysis (1); Qualitative research (1); Quality (1); Quality assurance (2); Quality improvement (2); Quality information system (1); Quasi-convex programming (1); Quasi-convex programming · Sum-minimization problem · Sum of ratios problem · Subgradient method · Incremental approach (1); RFID (3); Radio Data Systems (1); Randomized response model (2); Randomized response technique (2); Randomizing device (1); Reactive ion etching (1); Real estate (1); Recurrent Neural Networks (1); Recursive algorithm (1); Recycle (1); Recycle and reuse (1); Regime switching (1); Regime-switching (1); Regime-switching price impact (1); Region competition (1); Reinsurance, principal–agent problem, value-at-risk, combination of deductible and quota-share (1); Relationship Marketing (1); Relative performance (1); Remanufacturing (2); Remanufacturing, Product design, Component reuse, Decision cost model (1); Replenishment strategy (1); Replenishment system (1); Resource allocation (2); Return predictability (4); Reverse logistics (1); Reverse transfer (1); Risk analytics (1); Risk assessment (1); Robust scheduling (1); Routing (2); Rule extraction from ANN (1); SSD algorithm (1); Sales strategy formulation (1); Sample sort simulated annealing (SSA) (1); Search problems , Quadratic programming , Pattern recognition , Computational complexity , Image restoration (1); Segmentation (1); Selective bricolage (1); Sensitive questions (4); Service contract (1); Service parts management, service contract, stochastic programming, inventory, spare part (2); Service priority (1); Sethi Advertising Model (1); Sethi model (1); Ship alliance, slot allocation, artificial intelligence, genetic algorithm, optimisation (1); Ship lease, ship acquisition, ship chartering, portfolio analysis, conditional value-at-risk (1); Shipment planning (1); Short Packet (1); Simulation (1); Small Sample Size (1); Small liquidity costs (1); Smart transportation (1); Social Media (1); Social presence (1); Social repeated games; reinforcement learning; multi-agents; social norms (1); Space logistics (1); Spare part management (1); Spatial Durbin Model (1); Species sampling mixture model; Partition; Rao-Blackwell improvement; Sequential importance sampling; Weighted Chinese restaurant process (1); Speed of adjustment (1); Stackelberg equilibrium (1); Staff demand modelling (1); Staff scheduling (1); Staffing optimisation (1); State-space models (1); Statistical models. (1); Stochastic control (1); Stochastic factors (1); Stochastic market resilience (1); Stochastic optimal control (1); Stochastic representation (2); Stock allocation (1); Stock market, k-means, multi-objective, portfolio optimization. (1); Storage conditions (1); Strategic asset allocation (1); Structural break (2); Structural equation models (2); Structural learning (1); Subgradient method (1); Subsidiary innovation (1); Superellipse fitting (1); Supplier selection (1); Supply chain management (2); Supply chain network (1); Surrogate data (1); Survey sampling (1); Survivable network design (1); Sustainable design (1); Sustainable design, Remanufacturing, Product diffusion, dynamics, Bass model (1); System efficiency (1); System reliability (1); Systematic risks (1); Tabu search (1); Tabu-search (1); Taguchi method (1); Talent management (1); Target-chasing strategy (1); Temporary and permanent price impacts (1); Temporary and persistent price impacts (1); Temporary price impact (1); Terminal serviceability (1); Tertiary packaging (1); Tetragon (1); Threshold cointegration (1); Time series (2); Total variation (1); Trajectory planning (1); Transport logistics network; Multi-agents; Job assignment; Neighborhood search algorithm; Job consolidation. (1); Transshipment, Berth allocation, QC shifting heuristics, time steps, variable-in-time quay crane assignment (1); Tree-based Classifiers (1); Truck assignment (1); Truncated data (2); Trust (1); Two ordered Multinomials (1); Two-level structural equation model (1); Unconditional exact test (1); Unconditional half-life (1); Unified generalized iterative scaling (1); Uniform design (1); Uniform distribution (1); Unmanned aerial vehicle (1); Urban polycentricity (1); Utility maximization (1); Value at Risk (1); Variable neighborhood search (1); Varying-Coefficient (1); Vehicle routing (2); Vehicle routing problem (3); Viewpoint resampling (1); Warehouse management (1); Warehouse operation planning (1); Warehouse postponement application (1); Warehouse postponement applications (1); Warner’s model (1); White blood cell classification (1); Wilcoxon statistic (1); Wireless federated learning (1); Wireless sensor networks (1); Wisdom (1); Workforce planning (1); XGBoost (1); XML (1); Yard storage allocation problem (1); ZTBell (1)