Výsledky vyhledávání - (("Binary quadratic programming problem") OR ("Binary quadratic programming problems"))

  • Zobrazuji výsledky 1 - 13 z 13
Upřesnit hledání
  1. 1

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

    ISSN: 1568-4946, 1872-9681
    Vydáno: Elsevier B.V 01.08.2019
    Vydáno v 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…”
    Získat plný text
    Journal Article
  2. 2

    Digital Annealing Engine for High-speed Solving of Constrained Binary Quadratic Problems on Multiple GPUs Autor Katayama, Kentaro, Yoneoka, Noboru, Kanda, Kouichi, Tamura, Hirotaka, Nakayama, Hiroshi, Watanabe, Yasuhiro

    ISSN: 2158-4001
    Vydáno: IEEE 06.01.2024
    “…This paper presents a digital annealing engine capable of high-speed solving the Binary Quadratic Programming Problem (BQP) with equality and inequality…”
    Získat plný text
    Konferenční příspěvek
  3. 3

    Semi-supervised Learning for Large Scale Image Cosegmentation Autor Wang, Zhengxiang, Liu, Rujie

    ISSN: 1550-5499
    Vydáno: IEEE 01.12.2013
    “…This paper introduces to use semi-supervised learning for large scale image co segmentation. Different from traditional unsupervised co segmentation that does…”
    Získat plný text
    Konferenční příspěvek Journal Article
  4. 4

    Solution of boolean quadratic programming problems by two augmented Lagrangian algorithms based on a continuous relaxation Autor Nayak, Rupaj Kumar, Mohanty, Nirmalya Kumar

    ISSN: 1382-6905, 1573-2886
    Vydáno: New York Springer US 01.04.2020
    Vydáno v Journal of combinatorial optimization (01.04.2020)
    “…Many combinatorial optimization problems and engineering problems can be modeled as boolean quadratic programming (BQP) problems. In this paper, two augmented…”
    Získat plný text
    Journal Article
  5. 5

    Inner approximations of completely positive reformulations of mixed binary quadratic programs: a unified analysis Autor Yildirim, E Alper

    ISSN: 1055-6788, 1029-4937
    Vydáno: Abingdon Taylor & Francis 02.11.2017
    Vydáno v Optimization methods & software (02.11.2017)
    “…Every quadratic programming problem with a mix of continuous and binary variables can be equivalently reformulated as a completely positive optimization…”
    Získat plný text
    Journal Article
  6. 6

    Combining tabu Hopfield network and estimation of distribution for unconstrained binary quadratic programming problem Autor Wang, Jiahai, Zhou, Ying, Yin, Jian

    ISSN: 0957-4174, 1873-6793
    Vydáno: Elsevier Ltd 01.11.2011
    Vydáno v Expert systems with applications (01.11.2011)
    “…► This paper combines a tabu Hopfield neural network (THNN) with estimation of distribution algorithm (EDA) for combinatorial optimization problems. ► The…”
    Získat plný text
    Journal Article
  7. 7

    Memetic clonal selection algorithm with EDA vaccination for unconstrained binary quadratic programming problems Autor Cai, Yiqiao, Wang, Jiahai, Yin, Jian, Zhou, Yalan

    ISSN: 0957-4174, 1873-6793
    Vydáno: Elsevier Ltd 01.06.2011
    Vydáno v Expert systems with applications (01.06.2011)
    “…► MCSA-EDA proposes an estimation of distribution algorithm (EDA) vaccination, as hypermutation and recombination operator, to effectively use the global…”
    Získat plný text
    Journal Article
  8. 8

    Memetic algorithms for the unconstrained binary quadratic programming problem Autor Merz, Peter, Katayama, Kengo

    ISSN: 0303-2647, 1872-8324
    Vydáno: Ireland Elsevier Ireland Ltd 01.12.2004
    Vydáno v BioSystems (01.12.2004)
    “…This paper presents a memetic algorithm, a highly effective evolutionary algorithm incorporating local search for solving the unconstrained binary quadratic…”
    Získat plný text
    Journal Article
  9. 9

    Discrete Hopfield network combined with estimation of distribution for unconstrained binary quadratic programming problem Autor Wang, Jiahai

    ISSN: 0957-4174, 1873-6793
    Vydáno: Elsevier Ltd 01.08.2010
    Vydáno v Expert systems with applications (01.08.2010)
    “…Unconstrained binary quadratic programming problem (UBQP) consists in maximizing a quadratic 0-1 function. It is a well known NP-hard problem and is a unified…”
    Získat plný text
    Journal Article
  10. 10

    Cooperative annealing Hopfield network for unconstrained binary quadratic programming problem Autor Zhou, Ying, Wang, Jiahai, Yin, Jian

    ISSN: 0957-4174, 1873-6793
    Vydáno: Elsevier Ltd 01.10.2011
    Vydáno v Expert systems with applications (01.10.2011)
    “…► This paper first proposes an annealing HNN (AHNN) that permits temporary energy ascent to help the HNN escape from local minima. ► From a cooperative…”
    Získat plný text
    Journal Article
  11. 11

    An improved linearization technique for a class of quadratic 0-1 programming problems Autor He, Xiaozheng, Chen, Anthony, Chaovalitwongse, Wanpracha A., Liu, Henry X.

    ISSN: 1862-4472, 1862-4480
    Vydáno: Berlin/Heidelberg Springer-Verlag 01.01.2012
    Vydáno v Optimization letters (01.01.2012)
    “…The recent research on linearization techniques for solving 0-1 quadratic programming problems focuses on providing concise models and tightening constraint…”
    Získat plný text
    Journal Article
  12. 12

    A Low-Complexity High-Performance Preprocessing Algorithm for Multiuser Detection Using Gold Sequences Autor Axehill, D., Gunnarsson, F., Hansson, A.

    ISSN: 1053-587X, 1941-0476, 1941-0476
    Vydáno: New York, NY IEEE 01.09.2008
    “…The optimum multiuser detection problem can be formulated as a maximum likelihood problem, which yields a binary quadratic programming problem to be solved…”
    Získat plný text
    Journal Article
  13. 13

    Solving bi-objective unconstrained binary quadratic programming problem with multi-objective path relinking algorithm Autor Lei Song, Rong-Qiang Zeng, Yang Wang, Ming-Sheng Shang

    Vydáno: IEEE 01.08.2016
    “…This paper investigates a multi-objective path relinking algorithm in order to optimize a bi-objective unconstrained binary quadratic programming problem. In…”
    Získat plný text
    Konferenční příspěvek