Увійти

Готові списки джерел за темами / Binary quadratic programming / Статті в журналах

Щоб переглянути інші типи публікацій з цієї теми, перейдіть за посиланням: Binary quadratic programming.

Статті в журналах з теми "Binary quadratic programming"

Автор: Grafiati

Опубліковано: 11 січня 2025

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся з топ-50 статей у журналах для дослідження на тему "Binary quadratic programming".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Переглядайте статті в журналах для різних дисциплін та оформлюйте правильно вашу бібліографію.

1

MU, XUEWEN, SANYANG LID, and YALING ZHANG. "A SUCCESSIVE QUADRATIC PROGRAMMING ALGORITHM FOR SDP RELAXATION OF THE BINARY QUADRATIC PROGRAMMING." Bulletin of the Korean Mathematical Society 42, no. 4 (November 1, 2005): 837–49. http://dx.doi.org/10.4134/bkms.2005.42.4.837.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Mu, Xuewen, and Yaling Zhang. "A Rank-Two Feasible Direction Algorithm for the Binary Quadratic Programming." Journal of Applied Mathematics 2013 (2013): 1–7. http://dx.doi.org/10.1155/2013/963563.

Повний текст джерела

Анотація:

Based on the semidefinite programming relaxation of the binary quadratic programming, a rank-two feasible direction algorithm is presented. The proposed algorithm restricts the rank of matrix variable to be two in the semidefinite programming relaxation and yields a quadratic objective function with simple quadratic constraints. A feasible direction algorithm is used to solve the nonlinear programming. The convergent analysis and time complexity of the method is given. Coupled with randomized algorithm, a suboptimal solution is obtained for the binary quadratic programming. At last, we report some numerical examples to compare our algorithm with randomized algorithm based on the interior point method and the feasible direction algorithm on max-cut problem. Simulation results have shown that our method is faster than the other two methods.

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Wang, Yang, Zhipeng Lü, Fred Glover, and Jin-Kao Hao. "Path relinking for unconstrained binary quadratic programming." European Journal of Operational Research 223, no. 3 (December 2012): 595–604. http://dx.doi.org/10.1016/j.ejor.2012.07.012.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Sun, X. L., C. L. Liu, D. Li, and J. J. Gao. "On duality gap in binary quadratic programming." Journal of Global Optimization 53, no. 2 (February 18, 2011): 255–69. http://dx.doi.org/10.1007/s10898-011-9683-4.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

5

Kochenberger, Gary, Jin-Kao Hao, Fred Glover, Mark Lewis, Zhipeng Lü, Haibo Wang, and Yang Wang. "The unconstrained binary quadratic programming problem: a survey." Journal of Combinatorial Optimization 28, no. 1 (April 18, 2014): 58–81. http://dx.doi.org/10.1007/s10878-014-9734-0.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

6

Glover, Fred, and Jin-Kao Hao. "f-Flip strategies for unconstrained binary quadratic programming." Annals of Operations Research 238, no. 1-2 (December 11, 2015): 651–57. http://dx.doi.org/10.1007/s10479-015-2076-1.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Ronagh, Pooya, Brad Woods, and Ehsan Iranmanesh. "Solving constrained quadratic binary problems via quantum adiabatic evolution." Quantum Information and Computation 16, no. 11&12 (September 2016): 1029–47. http://dx.doi.org/10.26421/qic16.11-12-6.

Повний текст джерела

Анотація:

Quantum adiabatic evolution is perceived as useful for binary quadratic programming problems that are a priori unconstrained. For constrained problems, it is a common practice to relax linear equality constraints as penalty terms in the objective function. However, there has not yet been proposed a method for efficiently dealing with inequality constraints using the quantum adiabatic approach. In this paper, we give a method for solving the Lagrangian dual of a binary quadratic programming (BQP) problem in the presence of inequality constraints and employ this procedure within a branch-and-bound framework for constrained BQP (CBQP) problems.

Стилі APA, Harvard, Vancouver, ISO та ін.

8

Recht, Peter. "Characterization of optimal points in binary convex quadratic programming." Optimization 56, no. 1-2 (February 2007): 39–47. http://dx.doi.org/10.1080/02331930600815801.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

9

Merz, Peter, and Kengo Katayama. "Memetic algorithms for the unconstrained binary quadratic programming problem." Biosystems 78, no. 1-3 (December 2004): 99–118. http://dx.doi.org/10.1016/j.biosystems.2004.08.002.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

10

Liefooghe, Arnaud, Sébastien Verel, and Jin-Kao Hao. "A hybrid metaheuristic for multiobjective unconstrained binary quadratic programming." Applied Soft Computing 16 (March 2014): 10–19. http://dx.doi.org/10.1016/j.asoc.2013.11.008.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

11

Mauri, Geraldo Regis, and Luiz Antonio Nogueira Lorena. "Lagrangean decompositions for the unconstrained binary quadratic programming problem." International Transactions in Operational Research 18, no. 2 (February 2, 2011): 257–70. http://dx.doi.org/10.1111/j.1475-3995.2009.00743.x.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

12

Xia, Yong, and Wenxun Xing. "Parametric Lagrangian dual for the binary quadratic programming problem." Journal of Global Optimization 61, no. 2 (February 27, 2014): 221–33. http://dx.doi.org/10.1007/s10898-014-0164-4.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

13

Gondzio, Jacek, and E. Alper Yıldırım. "Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations." Journal of Global Optimization 81, no. 2 (April 20, 2021): 293–321. http://dx.doi.org/10.1007/s10898-021-01017-y.

Повний текст джерела

Анотація:

AbstractA standard quadratic program is an optimization problem that consists of minimizing a (nonconvex) quadratic form over the unit simplex. We focus on reformulating a standard quadratic program as a mixed integer linear programming problem. We propose two alternative formulations. Our first formulation is based on casting a standard quadratic program as a linear program with complementarity constraints. We then employ binary variables to linearize the complementarity constraints. For the second formulation, we first derive an overestimating function of the objective function and establish its tightness at any global minimizer. We then linearize the overestimating function using binary variables and obtain our second formulation. For both formulations, we propose a set of valid inequalities. Our extensive computational results illustrate that the proposed mixed integer linear programming reformulations significantly outperform other global solution approaches. On larger instances, we usually observe improvements of several orders of magnitude.

Стилі APA, Harvard, Vancouver, ISO та ін.

14

Zheng, Xiaojin, Yutong Pan, and Xueting Cui. "Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint." Journal of Global Optimization 70, no. 4 (February 26, 2018): 719–35. http://dx.doi.org/10.1007/s10898-017-0591-0.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

15

Moghadas, Foroogh Moeen, and Hossein Taghizadeh Kakhki. "Queueing Maximal Covering Location-Allocation Problem: An Extension with M/G/1 Queueing Systems." Advances in Decision Sciences 2011 (January 29, 2011): 1–13. http://dx.doi.org/10.1155/2011/605629.

Повний текст джерела

Анотація:

We consider the queueing maximal covering location-allocation problem (QM-CLAP) with an M/G/1 queueing system. We first formulate the problem as a binary quadratic programming problem and then propose a new solution procedure based on decomposition of the problem into smaller binary quadratic sub-problems. The heuristic procedure GRASP is used to solve the sub-problems, as well as the entire model. Some computational results are also presented.

Стилі APA, Harvard, Vancouver, ISO та ін.

16

Murakami, Takenori, Fubito Toyama, Kenji Shoji, and Jyuichi Miyamichi. "An Iterated Greedy Algorithm for the Binary Quadratic Programming Problem." IEEJ Transactions on Electronics, Information and Systems 130, no. 6 (2010): 1089–90. http://dx.doi.org/10.1541/ieejeiss.130.1089.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

17

Ren, Jianfeng, Xudong Jiang, Junsong Yuan, and Gang Wang. "Optimizing LBP Structure For Visual Recognition Using Binary Quadratic Programming." IEEE Signal Processing Letters 21, no. 11 (November 2014): 1346–50. http://dx.doi.org/10.1109/lsp.2014.2336252.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

18

Yang, Mei-Jia, Yong Xia, and Hui-Min Zou. "On linearization techniques for budget-constrained binary quadratic programming problems." Operations Research Letters 44, no. 6 (November 2016): 702–5. http://dx.doi.org/10.1016/j.orl.2016.09.002.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

19

Zheng, Xiaojin, Xiaoling Sun, Duan Li, and Yong Xia. "Duality Gap Estimation of Linear Equality Constrained Binary Quadratic Programming." Mathematics of Operations Research 35, no. 4 (November 2010): 864–80. http://dx.doi.org/10.1287/moor.1100.0472.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

20

Kim, Young Han, Sang Yeul Kim, and Ju Bong Kim. "Adaptive control of a binary distillation column using quadratic programming." Korean Journal of Chemical Engineering 6, no. 4 (October 1989): 306–12. http://dx.doi.org/10.1007/bf02705219.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

21

Huang, Hong-Xuan, Panos M. Pardalos, and Oleg A. Prokopyev. "Lower Bound Improvement and Forcing Rule for Quadratic Binary Programming." Computational Optimization and Applications 33, no. 2-3 (October 18, 2005): 187–208. http://dx.doi.org/10.1007/s10589-005-3062-3.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

22

Pan, Shaohua, Tao Tan, and Yuxi Jiang. "A global continuation algorithm for solving binary quadratic programming problems." Computational Optimization and Applications 41, no. 3 (November 9, 2007): 349–62. http://dx.doi.org/10.1007/s10589-007-9110-4.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

23

Jin, Weihua, Zhiying Hu, and Christine W. Chan. "A Genetic-Algorithms-Based Approach for Programming Linear and Quadratic Optimization Problems with Uncertainty." Mathematical Problems in Engineering 2013 (2013): 1–12. http://dx.doi.org/10.1155/2013/272491.

Повний текст джерела

Анотація:

This paper proposes a genetic-algorithms-based approach as an all-purpose problem-solving method for operation programming problems under uncertainty. The proposed method was applied for management of a municipal solid waste treatment system. Compared to the traditional interactive binary analysis, this approach has fewer limitations and is able to reduce the complexity in solving the inexact linear programming problems and inexact quadratic programming problems. The implementation of this approach was performed using the Genetic Algorithm Solver of MATLAB (trademark of MathWorks). The paper explains the genetic-algorithms-based method and presents details on the computation procedures for each type of inexact operation programming problems. A comparison of the results generated by the proposed method based on genetic algorithms with those produced by the traditional interactive binary analysis method is also presented.

Стилі APA, Harvard, Vancouver, ISO та ін.

24

G.S L. Brandão, Fernando, Richard Kueng, and Daniel Stilck França. "Faster quantum and classical SDP approximations for quadratic binary optimization." Quantum 6 (January 20, 2022): 625. http://dx.doi.org/10.22331/q-2022-01-20-625.

Повний текст джерела

Анотація:

We give a quantum speedup for solving the canonical semidefinite programming relaxation for binary quadratic optimization. This class of relaxations for combinatorial optimization has so far eluded quantum speedups. Our methods combine ideas from quantum Gibbs sampling and matrix exponent updates. A de-quantization of the algorithm also leads to a faster classical solver. For generic instances, our quantum solver gives a nearly quadratic speedup over state-of-the-art algorithms. Such instances include approximating the ground state of spin glasses and MaxCut on Erdös-Rényi graphs. We also provide an efficient randomized rounding procedure that converts approximately optimal SDP solutions into approximations of the original quadratic optimization problem.

Стилі APA, Harvard, Vancouver, ISO та ін.

25

Lara, Hugo José, Abel Soares Siqueira, and Jinyun Yuan. "A Reduced Semidefinite Programming Formulation for HA Assignment Problems in Sport Scheduling." TEMA (São Carlos) 19, no. 3 (December 17, 2018): 471. http://dx.doi.org/10.5540/tema.2018.019.03.471.

Повний текст джерела

Анотація:

Home-Away Assignment problems are naturally cast as quadraticpro gramming models in binary variables. In this work we compare alternative formulations for this kind of problems. First,write a quadratic programming formulation with linear constraints, and then a quadratically constrained version. We also propose another formulation by manipulating their special structure to obtain versions with 1/4 of the original size. The quadratic programming formulations leads to semidefinite relaxations, which allows us to approximately solve the models. We compare our SDP relaxation with the MIN-RES-CUT based formulation. Numerical experiments exhibit the characteristics of each model.

Стилі APA, Harvard, Vancouver, ISO та ін.

26

Douiri, Sidi Mohamed, and Souad Elbernoussi. "An unconstrained binary quadratic programming for the maximum independent set problem." Nonlinear Analysis: Modelling and Control 17, no. 4 (October 25, 2012): 410–17. http://dx.doi.org/10.15388/na.17.4.14047.

Повний текст джерела

Анотація:

For a given graph G = (V, E) the maximum independent set problem is to find the largest subset of pairwise nonadjacent vertices. We propose a new model which is a reformulation of the maximum independent set problem as an unconstrained quadratic binary programming, and we resolve it afterward by means of a genetic algorithm. The efficiency of the approach is confirmed by results of numerical experiments on DIMACS benchmarks.

Стилі APA, Harvard, Vancouver, ISO та ін.

27

Mauri, Geraldo Regis, and Luiz Antonio Nogueira Lorena. "A column generation approach for the unconstrained binary quadratic programming problem." European Journal of Operational Research 217, no. 1 (February 2012): 69–74. http://dx.doi.org/10.1016/j.ejor.2011.09.016.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

28

Wang, Yang, Jin-Kao Hao, Fred Glover, Zhipeng Lü, and Qinghua Wu. "Solving the maximum vertex weight clique problem via binary quadratic programming." Journal of Combinatorial Optimization 32, no. 2 (January 21, 2016): 531–49. http://dx.doi.org/10.1007/s10878-016-9990-2.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

29

Kochenberger, Gary A., Fred Glover, Bahram Alidaee, and Cesar Rego. "An Unconstrained Quadratic Binary Programming Approach to the Vertex Coloring Problem." Annals of Operations Research 139, no. 1 (October 2005): 229–41. http://dx.doi.org/10.1007/s10479-005-3449-7.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

30

Mauri, Geraldo Regis, and Luiz Antonio Nogueira Lorena. "Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem." Computers & Operations Research 39, no. 7 (July 2012): 1577–81. http://dx.doi.org/10.1016/j.cor.2011.09.008.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

31

Wang, Yulan, Zhixia Yang, and Xiaomei Yang. "Kernel-Free Quadratic Surface Minimax Probability Machine for a Binary Classification Problem." Symmetry 13, no. 8 (July 28, 2021): 1378. http://dx.doi.org/10.3390/sym13081378.

Повний текст джерела

Анотація:

In this paper, we propose a novel binary classification method called the kernel-free quadratic surface minimax probability machine (QSMPM), that makes use of the kernel-free techniques of the quadratic surface support vector machine (QSSVM) and inherits the advantage of the minimax probability machine (MPM) without any parameters. Specifically, it attempts to find a quadratic hypersurface that separates two classes of samples with maximum probability. However, the optimization problem derived directly was too difficult to solve. Therefore, a nonlinear transformation was introduced to change the quadratic function involved into a linear function. Through such processing, our optimization problem finally became a second-order cone programming problem, which was solved efficiently by an alternate iteration method. It should be pointed out that our method is both kernel-free and parameter-free, making it easy to use. In addition, the quadratic hypersurface obtained by our method was allowed to be any general form of quadratic hypersurface. It has better interpretability than the methods with the kernel function. Finally, in order to demonstrate the geometric interpretation of our QSMPM, five artificial datasets were implemented, including showing the ability to obtain a linear separating hyperplane. Furthermore, numerical experiments on benchmark datasets confirmed that the proposed method had better accuracy and less CPU time than corresponding methods.

Стилі APA, Harvard, Vancouver, ISO та ін.

32

Vyskocil, Tomas, and Hristo Djidjev. "Embedding Equality Constraints of Optimization Problems into a Quantum Annealer." Algorithms 12, no. 4 (April 17, 2019): 77. http://dx.doi.org/10.3390/a12040077.

Повний текст джерела

Анотація:

Quantum annealers such as D-Wave machines are designed to propose solutions for quadratic unconstrained binary optimization (QUBO) problems by mapping them onto the quantum processing unit, which tries to find a solution by measuring the parameters of a minimum-energy state of the quantum system. While many NP-hard problems can be easily formulated as binary quadratic optimization problems, such formulations almost always contain one or more constraints, which are not allowed in a QUBO. Embedding such constraints as quadratic penalties is the standard approach for addressing this issue, but it has drawbacks such as the introduction of large coefficients and using too many additional qubits. In this paper, we propose an alternative approach for implementing constraints based on a combinatorial design and solving mixed-integer linear programming (MILP) problems in order to find better embeddings of constraints of the type ∑ x i = k for binary variables x i. Our approach is scalable to any number of variables and uses a linear number of ancillary variables for a fixed k.

Стилі APA, Harvard, Vancouver, ISO та ін.

33

Wang, Qiwei. "Support vector machine based on the quadratic unconstrained binary optimization model." Journal of Physics: Conference Series 2858, no. 1 (October 1, 2024): 012002. http://dx.doi.org/10.1088/1742-6596/2858/1/012002.

Повний текст джерела

Анотація:

Abstract Support vector machine (SVM) is a powerful supervised machine learning model that is often used in binary classification algorithms. As Moore’s Law approaches its theoretical limits and the demand for machine learning to handle large-scale, high-dimensional data analysis intensifies, the necessity of adopting non-traditional computational approaches becomes evident. Quantum computing, in particular, emerges as a vital solution for the effective training of SVM models, providing capabilities beyond those of classical computing systems. To solve the above problems, a QUBO (quadratic unconstrained binary optimization) model is proposed to transform the SVM machine learning model into a quadratic unconstrained binary optimization problem so that they can be effectively trained on the D-Wave platform using adiabatic quantum computer. The results show that the QUBO model can transform the SVM model into a simple quadratic programming problem, which makes it suitable for adiabatic quantum computer processing. When processing large-scale and high-dimensional data, this transformation shows a natural advantage and significantly improves computational efficiency. The application potential of this transformation technology is huge in the medical field.

Стилі APA, Harvard, Vancouver, ISO та ін.

34

Zhang, Lu, Frans Coenen, and Paul Leng. "Setting attribute weights for k-NN based binary classification via quadratic programming." Intelligent Data Analysis 7, no. 5 (November 17, 2003): 427–41. http://dx.doi.org/10.3233/ida-2003-7504.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

35

Gui, Jihong, Zhipeng Jiang, and Suixiang Gao. "PCI Planning Based on Binary Quadratic Programming in LTE/LTE-A Networks." IEEE Access 7 (2019): 203–14. http://dx.doi.org/10.1109/access.2018.2885313.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

36

Lu, Cheng, and Xiaoling Guo. "Convex reformulation for binary quadratic programming problems via average objective value maximization." Optimization Letters 9, no. 3 (July 17, 2014): 523–35. http://dx.doi.org/10.1007/s11590-014-0768-0.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

37

Shylo, V. P., and O. V. Shylo. "Systems Analysis; Solving unconstrained binary quadratic programming problem by global equilibrium search." Cybernetics and Systems Analysis 47, no. 6 (November 2011): 889–97. http://dx.doi.org/10.1007/s10559-011-9368-5.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

38

LEWIS, MARK, and GARY KOCHENBERGER. "GRAPH BISECTION MODELED AS CARDINALITY CONSTRAINED BINARY QUADRATIC TASK ALLOCATION." International Journal of Information Technology & Decision Making 12, no. 02 (March 2013): 261–76. http://dx.doi.org/10.1142/s0219622013500119.

Повний текст джерела

Анотація:

In this paper, the cardinality constrained quadratic model for binary quadratic programming is used to model and solve the graph bisection problem as well as its generalization in the form of the task allocation problem with two processors (2-TAP). Balanced graph bisection is an NP-complete problem which partitions a set of nodes in the graph G = (N, E) into two sets with equal cardinality such that a minimal sum of edge weights exists between the nodes in the two separate sets. 2-TAP is graph bisection with the addition of node preference costs in the objective function. We transform the general linear k-TAP model to the cardinality constrained quadratic binary model so that it may be efficiently solved using tabu search with strategic oscillation. On a set of benchmark graph bisections, we improve the best known solution for several problems. Comparison results with the state-of-the-art graph partitioning program METIS, as well as Cplex and Gurobi are presented on a set of randomly generated graphs. This approach is shown to also work well with 2-TAP, comparing favorably to Cplex and Gurobi, providing better solutions in a much shorter time.

Стилі APA, Harvard, Vancouver, ISO та ін.

39

Katayama, Kengo, and Hiroyuki Narihisa. "Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem." European Journal of Operational Research 134, no. 1 (October 2001): 103–19. http://dx.doi.org/10.1016/s0377-2217(00)00242-3.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

40

Gu, Shenshen, Tao Hao, and Hanmei Yao. "A pointer network based deep learning algorithm for unconstrained binary quadratic programming problem." Neurocomputing 390 (May 2020): 1–11. http://dx.doi.org/10.1016/j.neucom.2019.06.111.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

41

Cai, Yiqiao, Jiahai Wang, Jian Yin, and Yalan Zhou. "Memetic clonal selection algorithm with EDA vaccination for unconstrained binary quadratic programming problems." Expert Systems with Applications 38, no. 6 (June 2011): 7817–27. http://dx.doi.org/10.1016/j.eswa.2010.12.124.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

42

Mu, Xuewen, Yaling Zhang, and Sanyang Liu. "A new branch and bound method with pretreatment for the binary quadratic programming." Applied Mathematics and Computation 192, no. 1 (September 2007): 252–59. http://dx.doi.org/10.1016/j.amc.2007.03.006.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

43

Kratica, Jozef. "A Mixed Integer Quadratic Programming Model for the Low Autocorrelation Binary Sequence Problem." Serdica Journal of Computing 6, no. 4 (March 20, 2013): 385–400. http://dx.doi.org/10.55630/sjc.2012.6.385-400.

Повний текст джерела

Анотація:

In this paper the low autocorrelation binary sequence problem (LABSP) is modeled as a mixed integer quadratic programming (MIQP) problem and proof of the model’s validity is given. Since the MIQP model is semidefinite, general optimization solvers can be used, and converge in a finite number of iterations. The experimental results show that IQP solvers, based on this MIQP formulation, are capable of optimally solving general/skew-symmetric LABSP instances of up to 30/51 elements in a moderate time. ACM Computing Classification System (1998): G.1.6, I.2.8.

Стилі APA, Harvard, Vancouver, ISO та ін.

44

Lu, Cheng, Zhenbo Wang, and Wenxun Xing. "An improved lower bound and approximation algorithm for binary constrained quadratic programming problem." Journal of Global Optimization 48, no. 3 (December 18, 2009): 497–508. http://dx.doi.org/10.1007/s10898-009-9504-1.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

45

Zhou, Ying, Lingjing Kong, Yong Liu, Yiqiao Cai, and Shaopeng Liu. "A Single Deep Neural Network Model for Multiobjective Unconstrained Binary Quadratic Programming Problem." International Journal of Cognitive Informatics and Natural Intelligence 18, no. 1 (December 3, 2024): 1–17. https://doi.org/10.4018/ijcini.361012.

Повний текст джерела

Анотація:

The multiobjective unconstrained binary quadratic programming problem is an important combinatorial optimization problem with both theory and practical values. Until now, several efforts have been made to design metaheuristic methods to solve the problem. However, designing such effective methods is not trivial and heavily depends on experts' specific knowledge. Meanwhile, due to the iterative nature of metaheuristic methods, they require a long time to find high-quality solutions. From the perspective of machine learning, this paper proposes a deep reinforcement learning method to solve the problem. The method can automatically learn effective heuristics from a large amount of data, thus decreasing the need for experts' knowledge. Meanwhile, by leveraging the power of GPU, the method can quickly obtain high-quality solutions for a batch of instances. Experimental results show the proposed method outperforms two classical metaheuristic methods in terms of solution quality and running time for solving the problem.

Стилі APA, Harvard, Vancouver, ISO та ін.

46

Zdunek, Rafał, Andrzej Grobelny, Jerzy Witkowski, and Radosław Igor Gnot. "On–Off Scheduling for Electric Vehicle Charging in Two-Links Charging Stations Using Binary Optimization Approaches." Sensors 21, no. 21 (October 28, 2021): 7149. http://dx.doi.org/10.3390/s21217149.

Повний текст джерела

Анотація:

In this study, we deal with the problem of scheduling charging periods of electrical vehicles (EVs) to satisfy the users’ demands for energy consumption as well as to optimally utilize the available power. We assume three-phase EV charging stations, each equipped with two charging ports (links) that can serve up to two EVs in the scheduling period but not simultaneously. Considering such a specification, we propose an on–off scheduling scheme wherein control over an energy flow is achieved by flexibly switching the ports in each station on and off in a manner such as to satisfy the energy demand of each EV, flatten the high energy-consuming load on the whole farm, and to minimize the number of switching operations. To satisfy these needs, the on–off scheduling scheme is formulated in terms of a binary linear programming problem, which is then extended to a quadratic version to incorporate the smoothness constraints. Various algorithmic approaches are used for solving a binary quadratic programming problem, including the Frank–Wolfe algorithm and successive linear approximations. The numerical simulations demonstrate that the latter is scalable, efficient, and flexible in a charging procedure, and it shaves the load peak while maintaining smooth charging profiles.

Стилі APA, Harvard, Vancouver, ISO та ін.

47

Moraru, Vasile, Daniela Istrati, and Sergiu Zaporojan. "SOLVING THE DAYS-OFF SCHEDULING PROBLEM USING QUADRATIC PROGRAMMING WITH CIRCULANT MATRIX." Journal of Engineering Science 29, no. 4 (January 2023): 97–108. http://dx.doi.org/10.52326/jes.utm.2022.29(4).05.

Повний текст джерела

Анотація:

The purpose of this paper is the approach of a mathematical model dedicated to planning the consecutive days off of a company’s employees. Companies must find a flexible work schedule between employees, always considering the satisfaction of work tasks as well as guaranteeing consecutive days off. The analysis is based on solving a quadratic programming problem with binary variables. The proposed method uses the properties of the circulant symmetric matrix in the researched model, which allows the transformation of the considered problems into an equivalent separable non-convex optimization problem. A practical continuous convex relaxation approach is proposed. DC Algorithm is used to solve relaxed problems. A solved numerical example is presented.

Стилі APA, Harvard, Vancouver, ISO та ін.

48

Zavvar Sabegh, Mohammad Reza, and Chris Bingham. "Model Predictive Control with Binary Quadratic Programming for the Scheduled Operation of Domestic Refrigerators." Energies 12, no. 24 (December 7, 2019): 4649. http://dx.doi.org/10.3390/en12244649.

Повний текст джерела

Анотація:

The rapid proliferation of the ‘Internet of Things’ (IoT) now affords the opportunity to schedule the operation of widely distributed domestic refrigerator and freezers to collectively improve energy efficiency and reduce peak power consumption on the electrical grid. To accomplish this, the paper proposes the real-time estimation of the thermal mass of each refrigerator in a network using on-line parameter identification, and the co-ordinated (ON-OFF) scheduling of the refrigerator compressors to maintain their respective temperatures within specified hysteresis bands commensurate with accommodating food safety standards. A custom model predictive control (MPC) scheme is devised using binary quadratic programming to realize the scheduling methodology which is implemented through IoT hardware (based on a NodeMCU). Benefits afforded by the proposed scheme are investigated through experimental trials which show that the co-ordinated operation of domestic refrigerators can i) reduce the peak power consumption as seen from the perspective of the electrical power grid (i.e., peak load levelling), ii) can adaptively control the temperature hysteresis band of individual refrigerators to increase operational efficiency, and iii) contribute to a widely distributed aggregated load shed for demand side response purposes in order to aid grid stability. Importantly, the number of compressor starts per hour for each refrigerator is also bounded as an inherent design feature of the algorithm so as not to operationally overstress the compressors and reduce their lifetime. Experimental trials show that such co-ordinated operation of refrigerators can reduce energy consumption by ~30% whilst also providing peak load levelling, thereby affording benefits to both individual consumers as well as electrical network suppliers.

Стилі APA, Harvard, Vancouver, ISO та ін.

49

Zhou, Ying, Lingjing Kong, Ziyan Wu, Shaopeng Liu, Yiqiao Cai, and Ye Liu. "Ensemble of multi-objective metaheuristic algorithms for multi-objective unconstrained binary quadratic programming problem." Applied Soft Computing 81 (August 2019): 105485. http://dx.doi.org/10.1016/j.asoc.2019.105485.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

50

Wang, Jiahai. "Discrete Hopfield network combined with estimation of distribution for unconstrained binary quadratic programming problem." Expert Systems with Applications 37, no. 8 (August 2010): 5758–74. http://dx.doi.org/10.1016/j.eswa.2010.02.032.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!