Search Results - (("Binary quadratic programming problem") OR ("Binary quadratic programming problemy"))

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

“…Metaheuristics have been widely utilized for solving NP-hard optimization problems. However, these algorithms usually perform differently from one problem to…”
Get full text

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

“…This paper presents a digital annealing engine capable of high-speed solving the Binary Quadratic Programming Problem (BQP) with equality and inequality…”
Get full text

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

“…This paper introduces to use semi-supervised learning for large scale image co segmentation. Different from traditional unsupervised co segmentation that does…”
Get full text

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

“…Many combinatorial optimization problems and engineering problems can be modeled as boolean quadratic programming (BQP) problems. In this paper, two augmented…”
Get full text

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

“…► This paper combines a tabu Hopfield neural network (THNN) with estimation of distribution algorithm (EDA) for combinatorial optimization problems. ► The…”
Get full text

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

“…► MCSA-EDA proposes an estimation of distribution algorithm (EDA) vaccination, as hypermutation and recombination operator, to effectively use the global…”
Get full text

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

“…This paper presents a memetic algorithm, a highly effective evolutionary algorithm incorporating local search for solving the unconstrained binary quadratic…”
Get full text

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

“…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…”
Get full text

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

“…► This paper first proposes an annealing HNN (AHNN) that permits temporary energy ascent to help the HNN escape from local minima. ► From a cooperative…”
Get full text

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

“…The recent research on linearization techniques for solving 0-1 quadratic programming problems focuses on providing concise models and tightening constraint…”
Get full text

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

“…The optimum multiuser detection problem can be formulated as a maximum likelihood problem, which yields a binary quadratic programming problem to be solved…”
Get full text

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

“…This paper investigates a multi-objective path relinking algorithm in order to optimize a bi-objective unconstrained binary quadratic programming problem. In…”
Get full text

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

“…Every quadratic programming problem with a mix of continuous and binary variables can be equivalently reformulated as a completely positive optimization…”
Get full text