Haibo Wang

Orcid: 0000-0002-8580-829X

Affiliations:
  • Texas A&M International University, A. R. Sanchez School of Business, Laredo, TX, USA
  • University of Mississippi, School of Business Administration, Oxford, MS, USA (PhD 2004)


According to our database1, Haibo Wang authored at least 51 papers between 2004 and 2023.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
A three-phase matheuristic algorithm for the multi-day task assignment problem.
Comput. Oper. Res., November, 2023

A new hybrid-heuristic for large-scale combinatorial optimization: A case of quadratic assignment problem.
Comput. Ind. Eng., May, 2023

An Efficient Closed-Form Formula for Evaluating r-Flip Moves in Quadratic Unconstrained Binary Optimization.
Algorithms, 2023

2022
Solving Clique Partitioning Problems: A Comparison of Models and Commercial Solvers.
Int. J. Inf. Technol. Decis. Mak., 2022

Integrating Machine Learning Algorithms With Quantum Annealing Solvers for Online Fraud Detection.
IEEE Access, 2022

Leveraging the Influence of Power Grid Links in Renewable Energy Power Generation.
IEEE Access, 2022

2021
The multi-skilled multi-period workforce assignment problem.
Int. J. Prod. Res., 2021

2019
A unified view of parallel machine scheduling with interdependent processing rates.
J. Sched., 2019

An effective multi-wave algorithm for solving the max-mean dispersion problem.
J. Heuristics, 2019

2018
Unrelated Parallel Machine Selection and Job Scheduling With the Objective of Minimizing Total Workload and Machine Fixed Costs.
IEEE Trans Autom. Sci. Eng., 2018

Variable selection in classification model via quadratic programming.
Commun. Stat. Simul. Comput., 2018

Computational experiment of critical event tabu search for the general integer multidimensional knapsack problem.
Ann. Oper. Res., 2018

2017
A note on heuristic approach based on UBQP formulation of the maximum diversity problem.
J. Oper. Res. Soc., 2017

A big data analytics framework for border crossing transportation.
Int. J. Big Data Intell., 2017

Simple and fast novel diversification approach for the UBQP based on sequential improvement local search.
Comput. Ind. Eng., 2017

2016
An ejection chain approach for the quadratic multiple knapsack problem.
Eur. J. Oper. Res., 2016

2015
Exact solutions to generalized vertex covering problems: a comparison of two models.
Optim. Lett., 2015

A Framework of Analyzing Border Crossing Transportation Data.
Proceedings of the 2015 IEEE International Conference on Smart City/SocialCom/SustainCom/DataCom/SC2 2015, 2015

Analysis of complex network in international business literature.
Proceedings of the 9th IEEE International Conference on Semantic Computing, 2015

Online negative public sentiment does not matter? - Empirical evidence from social media and movie industry.
Proceedings of the International Conference on Computing, Networking and Communications, 2015

2014
Position Unmanned Aerial Vehicles in the Mobile Ad Hoc Network.
J. Intell. Robotic Syst., 2014

The unconstrained binary quadratic programming problem: a survey.
J. Comb. Optim., 2014

Critical Infrastructure Management for Telecommunication Networks.
Int. J. Knowl. Syst. Sci., 2014

Evaluating telecommunications efficiency in China with data envelopment analysis.
Int. J. Inf. Decis. Sci., 2014

2013
Solving large scale Max Cut problems via tabu search.
J. Heuristics, 2013

A Computational Study for Feature Selection on Customer Credit Evaluation.
Proceedings of the IEEE International Conference on Systems, 2013

2012
A computational study on the quadratic knapsack problem with multiple constraints.
Comput. Oper. Res., 2012

Critical Infrastructure Management for Telecommunication Networks.
Proceedings of the Active Media Technology - 8th International Conference, 2012

2011
On the Flexible Demand Assignment Problems: Case of Unmanned Aerial Vehicles.
IEEE Trans Autom. Sci. Eng., 2011

A new feature selection method based on support vector machines for text categorisation.
Int. J. Data Anal. Tech. Strateg., 2011

2010
A note on optimal solutions to quadratic knapsack problems.
Int. J. Math. Model. Numer. Optimisation, 2010

The Analysis of Zero Inventory Drift Variants Based on Simple and General Order-Up-To Policies.
Int. J. Appl. Metaheuristic Comput., 2010

Theorems Supporting r-flip Search for Pseudo-Boolean Optimization.
Int. J. Appl. Metaheuristic Comput., 2010

A study of the relative efficiency of Chinese ports: a financial ratio-based data envelopment analysis approach.
Expert Syst. J. Knowl. Eng., 2010

A note on task assignment of several problems.
Comput. Ind. Eng., 2010

2009
A Note on Integer Programming Formulations of the Real-Time Optimal Scheduling and Flight Path Selection of UAVs.
IEEE Trans. Control. Syst. Technol., 2009

'Preventive maintenance scheduling of multi-cogeneration plants using integer programming'.
J. Oper. Res. Soc., 2009

Computationally attractive non-linear models for combinatorial optimisation.
Int. J. Math. Oper. Res., 2009

Solving the market split problem via branch-and-cut.
Int. J. Math. Model. Numer. Optimisation, 2009

Research on Financial Warning for Chinese Listed Companies by Using Panel Data Model.
Proceedings of the IEEE International Conference on Systems, 2009

A Multi-Objective Decision Making on Reliability Growth Planning for In-Service Systems.
Proceedings of the IEEE International Conference on Systems, 2009

2008
Simulation Optimization: Applications in Risk Management.
Int. J. Inf. Technol. Decis. Mak., 2008

Simple and fast surrogate constraint heuristics for the maximum independent set problem.
J. Heuristics, 2008

A new approach for modeling and solving set packing problems.
Eur. J. Oper. Res., 2008

Clique Partitioning for Clustering: A Comparison with K-Means and Latent Class Analysis.
Commun. Stat. Simul. Comput., 2008

2007
An effective modeling and solution approach for the generalized independent set problem.
Optim. Lett., 2007

Solving the maximum edge weight clique problem via unconstrained quadratic programming.
Eur. J. Oper. Res., 2007

A Pseudo-Boolean Optimization for Multiple Criteria Decision Making in Complex Systems.
Proceedings of the Computational Science - ICCS 2007, 7th International Conference, Beijing, China, May 27, 2007

2005
Clustering of Microarray data via Clique Partitioning.
J. Comb. Optim., 2005

2004
An Interactive Clustering Methodology for High Dimensional Data Mining.
Proceedings of the Pacific Asia Conference on Information Systems, 2004

Evaluating a Clique Partitioning Problem Model for Clustering High-Dimensional Data Mining.
Proceedings of the 10th Americas Conference on Information Systems, 2004


  Loading...