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

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

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

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

Memetic algorithms for the unconstrained binary quadratic programming problem

Autoren: Merz, Peter Katayama, Kengo

Quelle: Biosystems. Dec2004, Vol. 78 Issue 1-3, p99-118. 20p.

Schlagwörter: *ALGORITHMS, *QUADRATIC programming, *ALGEBRA, *NONLINEAR programming

Systems Analysis; Solving unconstrained binary quadratic programming problem by global equilibrium search.

Autoren: Shylo, V. Shylo, O.

Quelle: Cybernetics & Systems Analysis. Nov2011, Vol. 47 Issue 6, p889-897. 9p.

Schlagwörter: *SYSTEM analysis, *ALGORITHMS, *QUADRATIC programming, *NONLINEAR programming, *MATHEMATICAL analysis

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

Discrete Hopfield network combined with estimation of distribution for unconstrained binary quadratic programming problem

Autoren: Wang, Jiahai¹ wjiahai@hotmail.com

Quelle: Expert Systems with Applications. Aug2010, Vol. 37 Issue 8, p5758-5774. 17p.

Schlagwörter: *ARTIFICIAL neural networks, *COMBINATORIAL optimization, *CONSTRAINT satisfaction, *QUADRATIC programming, *DISTRIBUTION (Probability theory), *ESTIMATION theory, *NP-complete problems, *PERTURBATION theory, *SIMULATION methods & models

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

Lagrangean decompositions for the unconstrained binary quadratic programming problem.

Autoren: Mauri, Geraldo Regis Lorena, Luiz Antonio Nogueira

Quelle: International Transactions in Operational Research. Mar2011, Vol. 18 Issue 2, p257-270. 14p. 4 Diagrams, 1 Chart.

Schlagwörter: *COMPUTER-aided design, QUADRATIC programming, BINARY number system, MATHEMATICAL decomposition, LAGRANGE equations, REAL numbers

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

The unconstrained binary quadratic programming problem: a survey

Autoren: Kochenberger, Gary Hao, Jin-Kao Glover, Fred et al.

Quelle: Journal of Combinatorial Optimization ; volume 28, issue 1, page 58-81 ; ISSN 1382-6905 1573-2886

Verfügbarkeit: https://doi.org/10.1007/s10878-014-9734-0
http://link.springer.com/content/pdf/10.1007/s10878-014-9734-0.pdf
http://link.springer.com/article/10.1007/s10878-014-9734-0/fulltext.html
http://link.springer.com/content/pdf/10.1007/s10878-014-9734-0

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

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 column generation approach for the unconstrained binary quadratic programming problem

Autoren: Mauri, Geraldo Regis Lorena, Luiz Antonio Nogueira

Quelle: European Journal of Operational Research. Feb2012, Vol. 217 Issue 1, p69-74. 6p.

Schlagwörter: *NONLINEAR programming, *LINEAR statistical models, *MATHEMATICAL analysis, QUADRATIC programming, CONSTRAINED optimization, GRAPH theory, PARTITIONS (Mathematics), MATHEMATICAL variables

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

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

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

Autoren: Zhou, Ying

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

Verfügbarkeit: https://doi.org/10.1109/cse-euc.2017.28
http://xplorestaging.ieee.org/ielx7/8004114/8005754/08005780.pdf?arnumber=8005780

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.

Weitere Verfasser: Zhou, Ying Wang, Jiahai Wu, Ziyan et al.

Quelle: Knowledge-Based Systems ; volume 141, page 18-30 ; ISSN 0950-7051

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