Výsledky vyhľadávania - (("binary quadratic programming problemy") OR ("binary quadratic programming problems"))~

Dimensionality reduction for binary quadratic programming problems

Autori: Rabih Battikh Bilal Hammoud Hassan Alabboud a ďalší

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

On linearization techniques for budget-constrained binary quadratic programming problems

Autori: Yong Xia Mei-Jia Yang Hui-Min Zou

Zdroj: Operations Research Letters. 44:702-705

Predmety: 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Prístupová URL adresa: https://dblp.uni-trier.de/db/journals/orl/orl44.html#YangXZ16
http://www.sciencedirect.com/science/article/pii/S0167637716300864
https://www.sciencedirect.com/science/article/pii/S0167637716300864

A heuristic solution to the optimisation of flutter control in compression systems (and to some more binary quadratic programming problems) via ΔΣ modulation circuits

Autori: S. CALLEGARI BIZZARRI, FEDERICO

Zdroj: Proceedings of 2010 IEEE International Symposium on Circuits and Systems. :1815-1818

Predmety: 0209 industrial biotechnology, sezele, 4. Education, 0103 physical sciences, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, 01 natural sciences

Popis súboru: application/pdf

Prístupová URL adresa: https://dblp.uni-trier.de/db/conf/iscas/iscas2010.html#CallegariB10
https://ieeexplore.ieee.org/document/5537729/
http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000005537729

Polynomial time solvable algorithm to linearly constrained binary quadratic programming problems with Q being a five-diagonal matrix

Autori: Shenshen Gu Rui Cui

Zdroj: Fifth International Conference on Intelligent Control and Information Processing. :366-372

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

Prístupová URL adresa: https://ieeexplore.ieee.org/abstract/document/7010280
http://ieeexplore.ieee.org/document/7010280/

Convex reformulation for binary quadratic programming problems via average objective value maximization

Autori: Cheng Lu Xiaoling Guo

Zdroj: Optimization Letters. 9:523-535

Predmety: 0211 other engineering and technologies, 1. No poverty, 02 engineering and technology

Polynomial time solvable algorithms to binary quadratic programming problems with Q being a tri-diagonal or five-diagonal matrix

Autori: Shenshen Gu

Zdroj: 2010 International Conference on Wireless Communications & Signal Processing (WCSP). :1-5

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

Prístupová URL adresa: https://ieeexplore.ieee.org/document/5632199/
https://dblp.uni-trier.de/db/conf/wcsp/wcsp2010.html#Gu10
http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000005632199

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

A Polynomial Time Solvable Algorithm to Linearly Constrained Binary Quadratic Programming Problems with Q being a Tri-Diagonal Matrix

Autori: Shenshen Gu

Zdroj: INTERNATIONAL JOURNAL ON Advances in Information Sciences and Service Sciences. 3:65-72

Predmety: 0209 industrial biotechnology, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Prístupová URL adresa: http://www.aicit.org/aiss/global/paper_detail.html?jname=AISS&q=208

A global continuation algorithm for solving binary quadratic programming problems

Autori: Yuxi Jiang Tao Tan Shaohua Pan

Zdroj: Computational Optimization and Applications. 41:349-362

Predmety: 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Prístupová URL adresa: https://dblp.uni-trier.de/db/journals/coap/coap41.html#PanTJ08
https://link.springer.com/content/pdf/10.1007%2Fs10589-007-9110-4.pdf
https://link.springer.com/article/10.1007/s10589-007-9110-4

Performance of various methods for the solution of binary quadratic programming problems

Autori: Fumihiro Hasegawa Peter Willett Jie Luo a ďalší

Zdroj: 2001 IEEE International Conference on Systems, Man and Cybernetics. e-Systems and e-Man for Cybernetics in Cyberspace (Cat.No.01CH37236). 4:2781-2786

Predmety: 0508 media and communications, 05 social sciences, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Prístupová URL adresa: https://dblp.uni-trier.de/db/conf/smc/smc2001.html#HasegawaLPW01a

A Polynomial Time Solvable Algorithm to Binary Quadratic Programming Problems with Q Being a Seven-Diagonal Matrix and Its Neural Network Implementation

Autori: Shenshen Gu Jiao Peng Rui Cui

Zdroj: Lecture Notes in Computer Science ISBN: 9783319124353

Predmety: 13. Climate action

Prístupová URL adresa: https://rd.springer.com/chapter/10.1007/978-3-319-12436-0_38
https://link.springer.com/chapter/10.1007/978-3-319-12436-0_38

Combining Discrete Ellipsoid-Based Search and Branch-and-Cut for Binary Quadratic Programming Problems

Autori: Wen-Yang Ku J. Christopher Beck

Zdroj: Lecture Notes in Computer Science ISBN: 9783319070452

Predmety: 13. Climate action

Prístupová URL adresa: http://tidel.mie.utoronto.ca/pubs/bqp-cpaior2014.pdf
https://rd.springer.com/chapter/10.1007/978-3-319-07046-9_24
https://link.springer.com/chapter/10.1007/978-3-319-07046-9_24
https://dblp.uni-trier.de/db/conf/cpaior/cpaior2014.html#KuB14
https://tidel.mie.utoronto.ca/pubs/bqp-cpaior2014.pdf

Approximation Schemes for Binary Quadratic Programming Problems with Low cp-Rank Decompositions

Autori: Elbassioni, Khaled Nguyen, Trung Thanh

Témy: Computer Science - Data Structures and Algorithms, Computer Science - Discrete Mathematics, text

URL: http://arxiv.org/abs/1411.5050

A heuristic solution to the optimisation of flutter control in compression systems (and to some more binary quadratic programming problems) via ∆Σ modulation circuits

Autori: BIZZARRI, FEDERICO CALLEGARI, SERGIO

Predmety: UNCONSTRAINED BINARY QUADRATIC PROGRAMMING, DELTA-SIGMA MODULATION, HEURISTIC OPTIMIZATION

Prístupová URL adresa: https://hdl.handle.net/11585/97432

The equivalence between doubly nonnegative relaxation and semidefinite relaxation for binary quadratic programming problems

Autori: Guo, Chuan-Hao Bai, Yan-Qin Tang, Li-Ping

Predmety: 90C10, 90C26, 49M20, Optimization and Control (math.OC), 0211 other engineering and technologies, FOS: Mathematics, 02 engineering and technology, Mathematics - Optimization and Control

Prístupová URL adresa: http://arxiv.org/abs/1211.5406

Additional Titles: On Recent Metaheuristics : Traveling Salesman, Graph Partitioning, Quadratic Assignment, Flow-shop Scheduling, Multidimensional Knapsack, Set Covering, and Binary Quadratic Programming Problems

Autori: Katayama, Kengo Narihisa, Hiroyuki

Témy: Departmental Bulletin Paper.

URL: https://ous.repo.nii.ac.jp/records/1661
https://ous.repo.nii.ac.jp/record/1661/files/36a15.pdf

A Novel Algorithm Based on the Bundle Method for Solving the Max-Cut Problem.

Autori: Kadhim, Fadhl Jawad Al-Jilawi, Ahmed Sabah

Zdroj: AppliedMath; Sep2025, Vol. 5 Issue 3, p92, 20p

Predmety: COMBINATORIAL optimization, SEMIDEFINITE programming, SCALABILITY, OPTIMIZATION algorithms, NUMERICAL calculations

A Polynomial Time Solvable Algorithm to Binary Quadratic Programming Problems with Q Being a Seven-Diagonal Matrix and Its Neural Network Implementation.

Autori: Gu, Shenshen Peng, Jiao Cui, Rui

Zdroj: Advances in Neural Networks - ISNN 2014; 2014, p338-346, 9p

Convex reformulation for binary quadratic programming problems via average objective value maximization.

Autori: Lu, Cheng Guo, Xiaoling

Zdroj: Optimization Letters; Mar2015, Vol. 9 Issue 3, p523-535, 13p