Suchergebnisse - unconstrained binary quadratic programming (problem* OR problemys*)*

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 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 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

A Vectorized Positive Semidefinite Penalty Method for Unconstrained Binary Quadratic Programming.

Autoren: Huo, Xinyue Gu, Ran

Quelle: Journal of Optimization Theory & Applications. Jan2026, Vol. 208 Issue 1, p1-31. 31p.

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

Autoren: Ziyan Wu Keke Wu Jiahai Wang et al.

Quelle: Knowledge-Based Systems. 141:18-30

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/kbs/kbs141.html#ZhouWWW18
https://www.sciencedirect.com/science/article/pii/S0950705117305300

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/

A Neural Network Based Global Optimal Algorithm for Unconstrained Binary Quadratic Programming Problem

Autoren: Xinyi Chen Shenshen Gu

Quelle: Lecture Notes in Computer Science ISBN: 9783030041786

A column generation approach for the unconstrained binary quadratic programming problem

Autoren: Luiz Antonio Nogueira Lorena Geraldo Regis Mauri

Quelle: European Journal of Operational Research. 217:69-74

Schlagwörter: 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem

Autoren: Hiroyuki Narihisa Kengo Katayama

Quelle: European Journal of Operational Research. 134:103-119

Schlagwörter: local search, 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, Boolean programming, heuristics, 02 engineering and technology, large-size problems, Approximation methods and heuristics in mathematical programming

Dateibeschreibung: application/xml

Zugangs-URL: https://www.sciencedirect.com/science/article/pii/S0377221700002423
http://www.sciencedirect.com/science/article/pii/S0377221700002423
https://dblp.uni-trier.de/db/journals/eor/eor134.html#KatayamaN01
https://econpapers.repec.org/article/eeeejores/v_3a134_3ay_3a2001_3ai_3a1_3ap_3a103-119.htm
https://ideas.repec.org/a/eee/ejores/v134y2001i1p103-119.html

Lagrangean decompositions for the unconstrained binary quadratic programming problem

Autoren: Geraldo Regis Mauri Luiz Antonio Nogueira Lorena

Quelle: International Transactions in Operational Research. 18:257-270

Schlagwörter: 0211 other engineering and technologies, 02 engineering and technology

Zugangs-URL: https://onlinelibrary.wiley.com/doi/10.1111/j.1475-3995.2009.00743.x
https://www.bv.fapesp.br/pt/publicacao/28942/lagrangean-decompositions-for-the-unconstrained-binary-quadr/
https://dblp.uni-trier.de/db/journals/itor/itor18.html#MauriL11

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

Autoren: O. V. Shylo V. P. Shylo

Quelle: Cybernetics and Systems Analysis. 47:889-897

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

Zugangs-URL: https://link.springer.com/article/10.1007/s10559-011-9368-5

Geração de colunas com divisão em clusters para o problema de programação quadrática binária irrestrita Column generation with clusters for the unconstrained binary quadratic programming problem

Autoren: Geraldo Regis Mauri Luiz Antonio Nogueira Lorena

Quelle: Gestão & Produção, Vol 16, Iss 4, Pp 515-525 (2009)

Schlagwörter: Programação quadrática, Geração de colunas, Relaxação lagrangeana, Quadratic programming, Column generation, Lagrangean relaxation, Industrial engineering. Management engineering, T55.4-60.8

Dateibeschreibung: electronic resource

Relation: http://www.scielo.br/scielo.php?script=sci_arttext&pid=S0104-530X2009000400002; https://doaj.org/toc/0104-530X; https://doaj.org/toc/1806-9649

Zugangs-URL: https://doaj.org/article/b103f94daebc4f99a000a94dcea5040b

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

Perturbation Based Search Method For Solving Unconstrained Binary Quadratic Programming Problem

Autoren: Solayappan, Muthu Ng, Kien Ming Poh, Kim Leng

Schlagwörter: interior point methods, perturbation, 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, unconstrained binary quadratic programming

Polynomial time solvable algorithms to a class of unconstrained and linearly constrained binary quadratic programming problems.

Autoren: Gu, Shenshen Cui, Rui Peng, Jiao

Quelle: Neurocomputing. Jul2016, Vol. 198, p171-179. 9p.

Schlagwörter: *POLYNOMIAL time algorithms, *QUADRATIC programming, *INTEGER programming, *SIGNAL processing, *NP-hard problems

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

An unconstrained binary quadratic programming for the maximum independent set problem

Autoren: Sidi Mohamed Douiri Souad Elbernoussi

Quelle: Nonlinear Analysis, Vol 17, Iss 4 (2012)

Schlagwörter: maximum independent set, Analysis, QA299.6-433

Dateibeschreibung: electronic resource

Relation: http://www.journals.vu.lt/nonlinear-analysis/article/view/14047; https://doaj.org/toc/1392-5113; https://doaj.org/toc/2335-8963

Zugangs-URL: https://doaj.org/article/e53a2fa2371b4cd0b3cabfeab194e276

f-Flip strategies for unconstrained binary quadratic programming

Autoren: Fred Glover Jin-Kao Hao Univ Angers, Okina

Weitere Verfasser: Fred Glover Jin-Kao Hao Univ Angers, Okina

Quelle: Annals of Operations Research. 238:651-657

Schlagwörter: Computational efficiency, 0–1 Optimization, metaheuristics, 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, [INFO] Computer Science [cs], Binary quadratic programming, Multi-start algorithms

Zugangs-URL: https://hal.science/hal-01412519v1
https://doi.org/10.1007/s10479-015-2076-1
https://link.springer.com/article/10.1007/s10479-015-2076-1
https://ideas.repec.org/a/spr/annopr/v238y2016i1d10.1007_s10479-015-2076-1.html
https://hal.archives-ouvertes.fr/hal-01412519
http://okina.univ-angers.fr/publications/ua15230/1/gloverhaoaor2015.pdf
https://EconPapers.repec.org/RePEc:spr:annopr:v:238:y:2016:i:1:p:651-657:10.1007/s10479-015-2076-1
http://okina.univ-angers.fr/publications/ua15230

Memetic Algorithms for the Unconstrained Binary Quadratic Programming Problem

Autoren: Peter Merz Kengo Katayama The Pennsylvania State University CiteSeerX Archives

Weitere Verfasser: Peter Merz Kengo Katayama The Pennsylvania State University CiteSeerX Archives

Quelle: http://www-ra.informatik.uni-tuebingen.de/mitarb/pmerz/papers/bs-bqp.ps.gz.

Schlagwörter: Unconstrained Binary Quadratic Programming Problem, Fitness Landscape Analysis, Evolutionary Algorithm, Local Search, Combinatorial Optimization

Dateibeschreibung: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.2.6624

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.2.6624
http://www-ra.informatik.uni-tuebingen.de/mitarb/pmerz/papers/bs-bqp.ps.gz