Search Results - "Unconstrained binary quadratic programming problem"

Refine Results
  1. 1
    Cover Image

    The unconstrained binary quadratic programming problem: a survey by Kochenberger, Gary, Hao, Jin-Kao, Glover, Fred, Lewis, Mark, Lü, Zhipeng, Wang, Haibo, Wang, Yang

    ISSN: 1382-6905, 1573-2886
    Published: Boston Springer US 01.07.2014
    Published in Journal of combinatorial optimization (01.07.2014)
    “…In recent years the unconstrained binary quadratic program (UBQP) has grown in importance in the field of combinatorial optimization due to its application…”
    Get full text
    Journal Article
    Save to List
    Saved in:
  2. 2
    Cover Image

    Closed-form formulas for evaluating r-flip moves to the unconstrained binary quadratic programming problem by Anacleto, Eduardo A.J., Meneses, Cláudio N., Ravelo, Santiago V.

    ISSN: 0305-0548, 1873-765X, 0305-0548
    Published: New York Elsevier Ltd 01.01.2020
    Published in Computers & operations research (01.01.2020)
    “… The Unconstrained Binary Quadratic Programming problem (UBQP) belongs to the NP-hard class and has become a framework for modeling a variety of combinatorial optimization problems…”
    Get full text
    Journal Article
    Save to List
    Saved in:
  3. 3
    Cover Image

    A pointer network based deep learning algorithm for unconstrained binary quadratic programming problem by Gu, Shenshen, Hao, Tao, Yao, Hanmei

    ISSN: 0925-2312, 1872-8286
    Published: Elsevier B.V 21.05.2020
    Published in Neurocomputing (Amsterdam) (21.05.2020)
    “…Combinatorial optimization problems have been widely used in various fields. And many types of combinatorial optimization problems can be generalized into the…”
    Get full text
    Journal Article
    Save to List
    Saved in:
  4. 4
    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:
  5. 5
    Cover Image

    A Single Deep Neural Network Model for Multiobjective Unconstrained Binary Quadratic Programming Problem by Zhou, Ying, Kong, Lingjing, Liu, Yong, Cai, Yiqiao, Liu, Shaopeng

    ISSN: 1557-3958, 1557-3966
    Published: Hershey IGI Global 01.01.2024
    “…The multiobjective unconstrained binary quadratic programming problem is an important combinatorial optimization problem with both theory and practical values…”
    Get full text
    Journal Article
    Save to List
    Saved in:
  6. 6
    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:
  7. 7
    Cover Image

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

    ISSN: 0950-7051, 1872-7409
    Published: Amsterdam Elsevier Science Ltd 01.02.2018
    Published in Knowledge-based systems (01.02.2018)
    “…Unconstrained binary quadratic programming problem (UBQP) is a well-known NP-hard problem…”
    Get full text
    Journal Article
    Save to List
    Saved in:
  8. 8
    Cover Image

    Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem by Mauri, Geraldo Regis, Lorena, Luiz Antonio Nogueira

    ISSN: 0305-0548, 1873-765X, 0305-0548
    Published: New York Elsevier Ltd 01.07.2012
    Published in Computers & operations research (01.07.2012)
    “…This paper presents a new alternative of Lagrangian decomposition based on column generation technique to solve the unconstrained binary quadratic programming problem…”
    Get full text
    Journal Article
    Save to List
    Saved in:
  9. 9
    Cover Image

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

    ISSN: 0303-2647, 1872-8324
    Published: Ireland Elsevier Ireland Ltd 01.12.2004
    Published in BioSystems (01.12.2004)
    “…This paper presents a memetic algorithm, a highly effective evolutionary algorithm incorporating local search for solving the unconstrained binary quadratic programming problem (BQP…”
    Get full text
    Journal Article
    Save to List
    Saved in:
  10. 10
    Cover Image

    A column generation approach for the unconstrained binary quadratic programming problem by Mauri, Geraldo Regis, Lorena, Luiz Antonio Nogueira

    ISSN: 0377-2217, 1872-6860
    Published: Amsterdam Elsevier B.V 16.02.2012
    Published in European journal of operational research (16.02.2012)
    “… with clusters to solve the unconstrained binary quadratic programming problem that consists of maximizing…”
    Get full text
    Journal Article
    Save to List
    Saved in:
  11. 11
    Cover Image

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

    ISSN: 0957-4174, 1873-6793
    Published: Elsevier Ltd 01.11.2011
    Published in Expert systems with applications (01.11.2011)
    “…–EDA is tested on unconstrained binary quadratic programming problems and maximum cut problems…”
    Get full text
    Journal Article
    Save to List
    Saved in:
  12. 12
    Cover Image

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

    ISSN: 0957-4174, 1873-6793
    Published: Elsevier Ltd 01.08.2010
    Published in Expert systems with applications (01.08.2010)
    “…Unconstrained binary quadratic programming problem (UBQP) consists in maximizing a quadratic 0-1 function…”
    Get full text
    Journal Article
    Save to List
    Saved in:
  13. 13
    Cover Image

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

    ISSN: 0957-4174, 1873-6793
    Published: Elsevier Ltd 01.10.2011
    Published in Expert systems with applications (01.10.2011)
    “… ► The proposed CoAHNN is validated on 21 unconstrained binary quadratic programming problems with the size ranging from 3000 to 7000, and 48 maximum cut problems with the size ranging from 512 to 3375…”
    Get full text
    Journal Article
    Save to List
    Saved in:
  14. 14
    Cover Image

    Lagrangean decompositions for the unconstrained binary quadratic programming problem by Mauri, Geraldo Regis, Lorena, Luiz Antonio Nogueira

    ISSN: 0969-6016, 1475-3995
    Published: Oxford, UK Blackwell Publishing Ltd 01.03.2011
    “…The unconstrained binary quadratic programming problem (QP) is a classical non‐linear problem of optimizing a quadratic objective by a suitable choice of binary decision variables…”
    Get full text
    Journal Article
    Save to List
    Saved in:
  15. 15
    Cover Image

    Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem by Katayama, Kengo, Narihisa, Hiroyuki

    ISSN: 0377-2217, 1872-6860
    Published: Amsterdam Elsevier B.V 01.10.2001
    Published in European journal of operational research (01.10.2001)
    “…The unconstrained binary quadratic programming problem (BQP) is known to be NP-hard and has many practical applications…”
    Get full text
    Journal Article
    Save to List
    Saved in:
  16. 16
    Cover Image

    Solving unconstrained binary quadratic programming problem by global equilibrium search by Shylo, V.P, Shylo, O.V

    ISSN: 1060-0396
    Published: Springer 01.11.2011
    Published in Cybernetics and systems analysis (01.11.2011)
    “…A new algorithm based on global equilibrium search (GES) is developed to solve an unconstrained binary quadratic programming (UBQP) problem. It is compared…”
    Get full text
    Journal Article
    Save to List
    Saved in:
  17. 17
    Cover Image

    A Method for Large Scale Unconstrained Binary Quadratic Programming Problem Based on Graph Neural Network by Huang, Jiajia, Gu, Shenshen

    ISSN: 2835-9577
    Published: IEEE 08.03.2024
    “…In recent years, the advantages of Graph Neural Networks (GNNs) in solving complex combinatorial optimization problems have become more and more obvious. Under…”
    Get full text
    Conference Proceeding
    Save to List
    Saved in:
  18. 18
    Cover Image

    Systems Analysis; Solving unconstrained binary quadratic programming problem by global equilibrium search by Shylo, V. P., Shylo, O. V.

    ISSN: 1060-0396, 1573-8337
    Published: Boston Springer US 01.11.2011
    Published in Cybernetics and systems analysis (01.11.2011)
    “…A new algorithm based on global equilibrium search (GES) is developed to solve an unconstrained binary quadratic programming (UBQP) problem. It is compared…”
    Get full text
    Journal Article
    Save to List
    Saved in:
  19. 19
    Cover Image

    A Parallel Tabu Search for the Unconstrained Binary Quadratic Programming problem by Jialong Shi, Qingfu Zhang, Derbel, Bilel, Liefooghe, Arnaud

    Published: IEEE 01.06.2017
    “…Although several sequential heuristics have been proposed for dealing with the Unconstrained Binary Quadratic Programming (UBQP), very little effort has been…”
    Get full text
    Conference Proceeding
    Save to List
    Saved in:
  20. 20
    Cover Image

    A Decomposition-Based Multi-Objective Tabu Search Algorithm for Tri-Objective Unconstrained Binary Quadratic Programming Problem by Ying Zhou

    ISBN: 9781538632208, 1538632209
    Published: IEEE 01.07.2017
    “…Unconstrained binary quadratic programming problem (UBQP) is a well-known NP hard problem that consists in maximizing a quadratic 0-1 function…”
    Get full text
    Conference Proceeding
    Save to List
    Saved in:

Search Tools: