Suchergebnisse - unconstrained binary quadratic programming (((problem OR problemsby) OR problemsys) OR problemsys)*

A Single Deep Neural Network Model for Multiobjective Unconstrained Binary Quadratic Programming Problem

Autoren: Ying Zhou Lingjing Kong Yong Liu et al.

Quelle: International Journal of Cognitive Informatics and Natural Intelligence. 18:1-17

Schlagwörter: 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

A pointer network based deep learning algorithm for unconstrained binary quadratic programming problem

Autoren: Tao Hao Shenshen Gu Hanmei Yao

Quelle: Neurocomputing. 390:1-11

Schlagwörter: 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Zugangs-URL: https://dblp.uni-trier.de/db/journals/ijon/ijon390.html#GuHY20
https://www.sciencedirect.com/science/article/abs/pii/S0925231220303398

An Effective Genetic Algorithm with Uniform Crossover for Bi-objective Unconstrained Binary Quadratic Programming Problem

Autoren: Ming-Sheng Shang Rong-Qiang Zeng Chao Huo et al.

Quelle: Lecture Notes in Computer Science ISBN: 9783319462561

Zugangs-URL: https://rd.springer.com/chapter/10.1007/978-3-319-46257-8_7
https://doi.org/10.1007/978-3-319-46257-8_7
https://link.springer.com/chapter/10.1007%2F978-3-319-46257-8_7

Solving Bi-objective Unconstrained Binary Quadratic Programming Problem with Multi-objective Backbone Guided Search Algorithm

Autoren: Rong-Qiang Zeng Mingsheng Shang Li-Yuan Xue et al.

Quelle: Lecture Notes in Computer Science ISBN: 9783319422930

Zugangs-URL: https://rd.springer.com/chapter/10.1007/978-3-319-42294-7_66
https://dblp.uni-trier.de/db/conf/icic/icic2016-2.html#XueZWS16
https://doi.org/10.1007/978-3-319-42294-7_66
https://link.springer.com/chapter/10.1007%2F978-3-319-42294-7_66
https://link.springer.com/chapter/10.1007/978-3-319-42294-7_66/fulltext.html

A Method for Large Scale Unconstrained Binary Quadratic Programming Problem Based on Graph Neural Network

Autoren: Jiajia Huang Shenshen Gu

Quelle: 2024 12th International Conference on Intelligent Control and Information Processing (ICICIP). :144-151

Ensemble of multi-objective metaheuristic algorithms for multi-objective unconstrained binary quadratic programming problem

Autoren: Ying Zhou Yiqiao Cai Lingjing Kong et al.

Quelle: Applied Soft Computing. 81:105485

Schlagwörter: 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Zugangs-URL: https://dblp.uni-trier.de/db/journals/asc/asc81.html#ZhouKWLCL19
https://www.sciencedirect.com/science/article/pii/S1568494619302558
https://doi.org/10.1016/j.asoc.2019.105485

A multi-objective tabu search algorithm based on decomposition for multi-objective unconstrained binary quadratic programming problem.

Autoren: Zhou, Ying Wang, Jiahai Wu, Ziyan et al.

Quelle: Knowledge-Based Systems. Feb2018, Vol. 141, p18-30. 13p.

Schlagwörter: *TABU search algorithm, *NP-hard problems, *PARETO analysis, *QUADRATIC programming, *MATHEMATICAL decomposition, *COMPUTATIONAL complexity

Combining tabu Hopfield network and estimation of distribution for unconstrained binary quadratic programming problem

Autoren: Wang, Jiahai Zhou, Ying Yin, Jian

Quelle: Expert Systems with Applications. Nov2011, Vol. 38 Issue 12, p14870-14881. 12p.

Schlagwörter: *ARTIFICIAL neural networks, *DISTRIBUTION (Probability theory), *CONSTRAINED optimization, *QUADRATIC programming, *BINARY number system, *NP-complete problems, *SEARCH algorithms, *HEURISTIC algorithms

Cooperative annealing Hopfield network for unconstrained binary quadratic programming problem

Autoren: Zhou, Ying Wang, Jiahai Yin, Jian

Quelle: Expert Systems with Applications. Oct2011, Vol. 38 Issue 11, p13894-13905. 12p.

Schlagwörter: *SIMULATED annealing, *ARTIFICIAL neural networks, *CONSTRAINED optimization, *QUADRATIC programming, *PROBABILITY theory, *INFORMATION technology, *NP-complete problems, *COMBINATORIAL optimization, *SIMULATION methods & models, *HEURISTIC algorithms

Memetic clonal selection algorithm with EDA vaccination for unconstrained binary quadratic programming problems

Autoren: Cai, Yiqiao Wang, Jiahai Yin, Jian et al.

Quelle: Expert Systems with Applications. Jun2011, Vol. 38 Issue 6, p7817-7827. 11p.

Schlagwörter: *GENETIC algorithms, *MEMETICS, *CLONAL selection theory, *QUADRATIC programming, *VACCINATION, *GENETIC recombination, *IMMUNOGLOBULINS, *MATHEMATICAL optimization

Memetic algorithms for the unconstrained binary quadratic programming problem.

Autoren: Merz P Katayama K

Quelle: Bio Systems [Biosystems] 2004 Dec; Vol. 78 (1-3), pp. 99-118.

Publikationsart: Journal Article

Info zur Zeitschrift: Publisher: Elsevier Science Ireland Country of Publication: Ireland NLM ID: 0430773 Publication Model: Print Cited Medium: Print ISSN: 0303-2647 (Print) Linking ISSN: 03032647 NLM ISO Abbreviation: Biosystems Subsets: MEDLINE

MeSH-Schlagworte: Algorithms* , Programming Languages*

Ensemble of multi-objective metaheuristic algorithms for multi-objective unconstrained binary quadratic programming problem.

Autoren: Zhou, Ying Kong, Lingjing Wu, Ziyan et al.

Quelle: Applied Soft Computing. Aug2019, Vol. 81, p105485-105485. 1p.

Schlagwörter: Metaheuristic algorithms, Quadratic programming, Combinatorial optimization, Mathematical optimization, NP-hard problems, Searching behavior

A Multiobjective Memetic Algorithm for Multiobjective Unconstrained Binary Quadratic Programming Problem

Autoren: Shaopeng Liu Ying Zhou Hong Jiaming et al.

Quelle: Lecture Notes in Computer Science ISBN: 9783030788100

Zugangs-URL: https://dblp.uni-trier.de/db/conf/swarm/icsi2021-2.html#Zhou0YLH21
https://link.springer.com/chapter/10.1007/978-3-030-78811-7_3

Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem

Autoren: Mauri, Geraldo Regis Lorena, Luiz Antonio Nogueira FAPES et al.

Weitere Verfasser: Mauri, Geraldo Regis Lorena, Luiz Antonio Nogueira FAPES et al.

Quelle: Computers & Operations Research ; volume 39, issue 7, page 1577-1581 ; ISSN 0305-0548

Verfügbarkeit: http://dx.doi.org/10.1016/j.cor.2011.09.008
https://api.elsevier.com/content/article/PII:S0305054811002693?httpAccept=text/xml
https://api.elsevier.com/content/article/PII:S0305054811002693?httpAccept=text/plain

A Parallel Tabu Search for the Unconstrained Binary Quadratic Programming problem

Autoren: Shi, Jialong Zhang, Qingfu Derbel, Bilel et al.

Weitere Verfasser: Shi, Jialong Zhang, Qingfu Derbel, Bilel et al.

Quelle: 2017 IEEE Congress on Evolutionary Computation (CEC). :557-564

Schlagwörter: 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, [MATH.MATH-OC] Mathematics [math]/Optimization and Control [math.OC], 02 engineering and technology, [INFO.INFO-RO] Computer Science [cs]/Operations Research [math.OC]

Dateibeschreibung: application/pdf

Zugangs-URL: https://hal.archives-ouvertes.fr/hal-01581361/file/shi.cec2017.pdf
https://hal.science/hal-01581361v1
https://hal.archives-ouvertes.fr/hal-01581361/document
https://dblp.uni-trier.de/db/conf/cec/cec2017.html#ShiZDL17
https://hal.archives-ouvertes.fr/hal-01581361
http://dblp.uni-trier.de/db/conf/cec/cec2017.html#ShiZDL17

Closed-form formulas for evaluating r-flip moves to the unconstrained binary quadratic programming problem

Autoren: Anacleto, Eduardo A.J. Meneses, Cláudio N. Ravelo, Santiago V. et al.

Weitere Verfasser: Anacleto, Eduardo A.J. Meneses, Cláudio N. Ravelo, Santiago V. et al.

Quelle: Computers & Operations Research ; volume 113, page 104774 ; ISSN 0305-0548

Verfügbarkeit: http://dx.doi.org/10.1016/j.cor.2019.104774
https://api.elsevier.com/content/article/PII:S0305054819302163?httpAccept=text/xml
https://api.elsevier.com/content/article/PII:S0305054819302163?httpAccept=text/plain

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

Autoren: Ying Zhou

Quelle: 22017 IEEE International Conference on Computational Science and Engineering (CSE) and IEEE International Conference on Embedded and Ubiquitous Computing (EUC). :101-107

Schlagwörter: 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Zugangs-URL: http://ieeexplore.ieee.org/document/8005780/
https://dblp.uni-trier.de/db/conf/cse/cse2017-1.html#Zhou17
https://ieeexplore.ieee.org/document/8005780/

The unconstrained binary quadratic programming problem: a survey

Autoren: G. Kochenberger J.K. Hao F. Glover et al.

Quelle: Journal of Combinatorial Optimization

Schlagwörter: combinatorial optimization, metaheuristics, Unconstrained binary quadratic programs

Relation: http://okina.univ-angers.fr/publications/ua7066

Verfügbarkeit: http://okina.univ-angers.fr/publications/ua7066
https://doi.org/10.1007/s10878-014-9734-0

Experiments on Neighborhood Combination Strategies for Bi-objective Unconstrained Binary Quadratic Programming Problem

Autoren: Xue, Li-Yuan Zeng, Rong-Qiang An, Wei et al.

Quelle: Communications in Computer and Information Science ; Parallel Architecture, Algorithm and Programming ; page 444-453 ; ISSN 1865-0929 1865-0937 ; ISBN 9789811064418 9789811064425

Verfügbarkeit: http://dx.doi.org/10.1007/978-981-10-6442-5_42
http://link.springer.com/content/pdf/10.1007/978-981-10-6442-5_42

Solving bi-objective unconstrained binary quadratic programming problem with multi-objective path relinking algorithm

Autoren: Lei Song Mingsheng Shang Yang Wang et al.

Quelle: 2016 12th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD). :289-293

Schlagwörter: 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology