Výsledky vyhľadávania - unconstrained binary quadratic programming (((problems OR problems) OR problems) OR problems)*

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

Autori: Jiao Peng Rui Cui Shenshen Gu

Zdroj: Neurocomputing. 198:171-179

Predmety: 0211 other engineering and technologies, 02 engineering and technology

Prístupová URL adresa: 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

Autori: Jian Yin Jiahai Wang Yiqiao Cai a ďalší

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

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

Autori: Ying Zhou Jian Yin Jiahai Wang

Zdroj: Expert Systems with Applications.

Predmety: 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Prístupová URL adresa: 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

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

Memetic algorithms for the unconstrained binary quadratic programming problem.

Autori: Merz P Katayama K

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

Spôsob vydávania: Journal Article

Informácie o časopise: 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

Výrazy zo slovníka MeSH: Algorithms* , Programming Languages*

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

Lagrangean decompositions for the unconstrained binary quadratic programming problem.

Autori: Mauri, Geraldo Regis Lorena, Luiz Antonio Nogueira

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

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

Quadratic reformulations of nonlinear binary optimization problems

Autori: Anthony, Martin Boros, Endre Crama, Yves a ďalší

Prispievatelia: Anthony, Martin Boros, Endre Crama, Yves a ďalší

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

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

Prístupová URL adresa: https://orbi.uliege.be/handle/2268/184526

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

Autori: Crama, Yves

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

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

Prístupová URL adresa: https://orbi.uliege.be/handle/2268/298280

A column generation approach for the unconstrained binary quadratic programming problem

Autori: Mauri, Geraldo Regis Lorena, Luiz Antonio Nogueira

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

Predmety: *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

Autori: Mauri, Geraldo Regis Lorena, Luiz Antonio Nogueira

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

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

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

A global continuation algorithm for solving binary quadratic programming problems.

Autori: Pan, Shaohua Tan, Tao Jiang, Yuxi

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

Predmety: *NONLINEAR programming, *MATHEMATICAL optimization, *COMPUTER programming, *MATHEMATICAL programming, *MATHEMATICAL analysis, QUADRATIC programming, NUMERICAL analysis

SOLVING INTEGER LINEAR PROGRAMMING PROBLEMS ON OPTIMIZATION SOLVER MACHINES

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

Autori: Katayama, Kengo Narihisa, Hiroyuki

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

Predmety: *MATHEMATICAL programming, *OPERATIONS research, *RESEARCH

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

Autori: Oshiyama, Hiroki Ohzeki, Masayuki

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

Predmety: QUANTUM annealing, SIMULATED annealing, PHASE transitions, SPIN glasses, HEURISTIC

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

Autori: Anacleto, Eduardo A.J. Meneses, Cláudio N. Ravelo, Santiago V.

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

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

A Hybrid Integer Encoding Method for Obtaining High-Quality Solutions of Quadratic Knapsack Problems on Solid-State Annealers

Autori: Daiki OKONOGI Jaehoon YU Kazushi KAWAMURA a ďalší

Zdroj: IEICE Transactions on Information and Systems. 2022, E105.D(12):2019

A hybrid metaheuristic approach to solving the UBQP problem

Autori: Lü, Zhipeng Glover, Fred Hao, Jin-Kao

Zdroj: European Journal of Operational Research. Dec2010, Vol. 207 Issue 3, p1254-1262. 9p.

Predmety: *PROBLEM solving, HEURISTIC algorithms, QUADRATIC programming, BINARY number system, OPERATOR theory, SEARCHING behavior, COMPUTATIONAL complexity