Suchergebnisse - unconstrained binary quadratic programming ((problems OR problems) OR problems)~

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

Autoren: Jiao Peng Rui Cui Shenshen Gu

Quelle: Neurocomputing. 198:171-179

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

Zugangs-URL: http://manuscript.elsevier.com/S0925231216003301/pdf/S0925231216003301.pdf
https://www.sciencedirect.com/science/article/pii/S0925231216003301
https://dblp.uni-trier.de/db/journals/ijon/ijon198.html#GuCP16
https://doi.org/10.1016/j.neucom.2015.09.130

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

Autoren: Jian Yin Jiahai Wang Yiqiao Cai et al.

Quelle: Expert Systems with Applications. 38:7817-7827

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

Cooperative annealing Hopfield network for unconstrained binary quadratic programming problem

Autoren: Ying Zhou Jian Yin Jiahai Wang

Quelle: Expert Systems with Applications.

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/eswa/eswa38.html#ZhouWY11
https://www.sciencedirect.com/science/article/pii/S0957417411007226
http://dblp.uni-trier.de/db/journals/eswa/eswa38.html#ZhouWY11

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*

Method and system for solving a convex integer quadratic programming problem using a binary optimizer

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

METHOD AND SYSTEM FOR SOLVING A CONVEX INTEGER QUADRATIC PROGRAMMING PROBLEM USING A BINARY OPTIMIZER

METHOD AND SYSTEM FOR SOLVING THE LAGRANGIAN DUAL OF A BINARY POLYNOMIALLY CONSTRAINED POLYNOMIAL PROGRAMMING PROBLEM USING A QUANTUM ANNEALER

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

Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem

Autoren: Mauri, Geraldo Regis Lorena, Luiz Antonio Nogueira

Quelle: Computers & Operations Research. Jul2012, Vol. 39 Issue 7, p1577-1581. 5p.

Schlagwörter: *PROBLEM solving, LAGRANGE equations, DECOMPOSITION method, BINARY control systems, QUADRATIC programming, COMPUTATIONAL acoustics, GRAPH algorithms

Quadratic reformulations of nonlinear binary optimization problems

Autoren: Anthony, Martin Boros, Endre Crama, Yves et al.

Weitere Verfasser: Anthony, Martin Boros, Endre Crama, Yves et al.

Quelle: Mathematical Programming, 162, 115-144 (2017)

Schlagwörter: nonlinear binary optimization, quadratic binary optimization, pseudo-Boolean functions, reformulation methods, Physical, chemical, mathematical & earth Sciences, Mathematics, Business & economic sciences, Quantitative methods in economics & management, Physique, chimie, mathématiques & sciences de la terre, Mathématiques, Sciences économiques & de gestion, Méthodes quantitatives en économie & gestion

Relation: urn:issn:0025-5610; urn:issn:1436-4646

Zugangs-URL: https://orbi.uliege.be/handle/2268/184526

Old and new algorithms for polynomial unconstrained optimization problems in binary variables

Autoren: Crama, Yves

Quelle: NUMA Study Day 2023, Gand, Belgium [BE], 9 January 2023

Schlagwörter: integer programming, polynomial binary optimization, quadratic optimization, pseudo-Boolean functions, dynamic programming, linearization, low autocorrelation sequences, Business & economic sciences, Quantitative methods in economics & management, Engineering, computing & technology, Computer science, Sciences économiques & de gestion, Méthodes quantitatives en économie & gestion, Ingénierie, informatique & technologie, Sciences informatiques

Zugangs-URL: https://orbi.uliege.be/handle/2268/298280

A global continuation algorithm for solving binary quadratic programming problems.

Autoren: Pan, Shaohua Tan, Tao Jiang, Yuxi

Quelle: Computational Optimization & Applications. Dec2008, Vol. 41 Issue 3, p349-362. 14p. 5 Charts.

Schlagwörter: *NONLINEAR programming, *MATHEMATICAL optimization, *COMPUTER programming, *MATHEMATICAL programming, *MATHEMATICAL analysis, QUADRATIC programming, NUMERICAL analysis

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

Autoren: Katayama, Kengo Narihisa, Hiroyuki

Quelle: European Journal of Operational Research. 10/01/2001, Vol. 134 Issue 1, p103-119. 17p. 4 Charts.

Schlagwörter: *MATHEMATICAL programming, *OPERATIONS research, *RESEARCH

METHOD AND SYSTEM FOR SOLVING THE LAGRANGIAN DUAL OF A BINARY POLYNOMIALLY CONSTRAINED POLYNOMIAL PROGRAMMING PROBLEM USING A QUANTUM ANNEALER

Benchmark of quantum-inspired heuristic solvers for quadratic unconstrained binary optimization.

Autoren: Oshiyama, Hiroki Ohzeki, Masayuki

Quelle: Scientific Reports; 2/9/2022, Vol. 12 Issue 1, p1-10, 10p

Schlagwörter: QUANTUM annealing, SIMULATED annealing, PHASE transitions, SPIN glasses, HEURISTIC

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.

Quelle: Computers & Operations Research. Jan2020, Vol. 113, pN.PAG-N.PAG. 1p.

Schlagwörter: *FACTORY orders, *TIME management, COMBINATORIAL optimization, MAXIMUM power point trackers, QUADRATIC programming, NEIGHBORHOODS

Benchmark of quantum-inspired heuristic solvers for quadratic unconstrained binary optimization

Autoren: Hiroki Oshiyama Masayuki Ohzeki

Quelle: Scientific Reports, Vol 12, Iss 1, Pp 1-10 (2022)

Schlagwörter: Medicine, Science

Dateibeschreibung: electronic resource

Relation: https://doaj.org/toc/2045-2322

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

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