Yang Wang

Orcid: 0000-0002-3864-0834

Affiliations:
  • Huazhong University of Science and Technology, School of Computer Science and Technology, Wuhan, China
  • University of Angers, France (PhD 2013)


According to our database1, Yang Wang authored at least 27 papers between 2010 and 2022.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
A two-phase tabu search based evolutionary algorithm for the maximum diversity problem.
Discret. Optim., 2022

2021
The Rank-One Quadratic Assignment Problem.
INFORMS J. Comput., 2021

2020
Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking.
INFORMS J. Comput., 2020

Local Search based on a New Neighborhood for Routing and Wavelength Assignment.
Proceedings of the 2020 IEEE International Conference on Systems, Man, and Cybernetics, 2020

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

Clustering-driven evolutionary algorithms: an application of path relinking to the quadratic unconstrained binary optimization problem.
J. Heuristics, 2019

Multi-Task Deep Learning With Dynamic Programming for Embryo Early Development Stage Classification From Time-Lapse Videos.
IEEE Access, 2019

Region Mutual Information Loss for Semantic Segmentation.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

2018
Adaptive tabu search with strategic oscillation for the bipartite boolean quadratic programming problem with partitioned variables.
Inf. Sci., 2018

OMG - Emotion Challenge Solution.
CoRR, 2018

2017
Path relinking for the vertex separator problem.
Expert Syst. Appl., 2017

Effective metaheuristic algorithms for the minimum differential dispersion problem.
Eur. J. Oper. Res., 2017

An effective iterated tabu search for the maximum bisection problem.
Comput. Oper. Res., 2017

2016
Multi-start iterated tabu search for the minimum weight vertex cover problem.
J. Comb. Optim., 2016

Solving the maximum vertex weight clique problem via binary quadratic programming.
J. Comb. Optim., 2016

2015
Iterated local search based on multi-type perturbation for single-machine earliness/tardiness scheduling.
Comput. Oper. Res., 2015

A tabu search based hybrid evolutionary algorithm for the max-cut problem.
Appl. Soft Comput., 2015

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

A tabu search based memetic algorithm for the maximum diversity problem.
Eng. Appl. Artif. Intell., 2014

2013
Metaheuristics for large binary quadratic optimization and its applications. (Métaheuristiques pour l'optimisation quadratique en 0/1 à grande échelle et ses applications).
PhD thesis, 2013

Backbone guided tabu search for solving the UBQP problem.
J. Heuristics, 2013

Solving the minimum sum coloring problem via binary quadratic programming
CoRR, 2013

Probabilistic GRASP-Tabu Search algorithms for the UBQP problem.
Comput. Oper. Res., 2013

2012
Path relinking for unconstrained binary quadratic programming.
Eur. J. Oper. Res., 2012

A Multilevel Algorithm for Large Unconstrained Binary Quadratic Optimization.
Proceedings of the Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems, 2012

2011
Effective Variable Fixing and Scoring Strategies for Binary Quadratic Programming.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2011

2010
A Study of Multi-parent Crossover Operators in a Memetic Algorithm.
Proceedings of the Parallel Problem Solving from Nature, 2010


  Loading...