Search Results - "Multi-objective unconstrained binary quadratic programming problems"

  • Showing 1 - 3 results of 3
Refine Results
  1. 1
    Cover Image

    Ensemble of multi-objective metaheuristic algorithms for multi-objective unconstrained binary quadratic programming problem by Zhou, Ying, Kong, Lingjing, Wu, Ziyan, Liu, Shaopeng, Cai, Yiqiao, Liu, Ye

    ISSN: 1568-4946, 1872-9681
    Published: Elsevier B.V 01.08.2019
    Published in Applied soft computing (01.08.2019)
    “…Metaheuristics have been widely utilized for solving NP-hard optimization problems. However, these algorithms usually perform differently from one problem to…”
    Get full text
    Journal Article
    Save to List
    Saved in:
  2. 2
    Cover Image

    A multi-objective tabu search algorithm based on decomposition for multi-objective unconstrained binary quadratic programming problem by Zhou, Ying, Wang, Jiahai, Wu, Ziyan, Wu, Keke

    ISSN: 0950-7051, 1872-7409
    Published: Elsevier B.V 01.02.2018
    Published in Knowledge-based systems (01.02.2018)
    “…•A multi-objective tabu search algorithm based on decomposition (DMTS) is proposed for multi-objective unconstrained binary quadratic programming problem…”
    Get full text
    Journal Article
    Save to List
    Saved in:
  3. 3
    Cover Image

    A directional-biased tabu search algorithm for multi-objective unconstrained binary quadratic programming problem by Ying Zhou, Jiahai Wang, Jian Yin

    Published: IEEE 01.10.2013
    “…Unconstrained binary quadratic programming problem (UBQP) consists in maximizing a quadratic 0-1 function. It is a well known NP-hard problem and is considered…”
    Get full text
    Conference Proceeding
    Save to List
    Saved in:

Search Tools: