Erratum to “A new branch and bound method with pretreatment for the binary quadratic programming” [Appl. Math. Comput. 192 (2007) 252–259]

Applied Mathematics and Computation ◽

10.1016/j.amc.2011.01.017 ◽

2011 ◽

Vol 217 (13) ◽

pp. 6441

Author(s):

Morteza Pakdaman

Keyword(s):

Quadratic Programming ◽

Branch And Bound ◽

Branch And Bound Method ◽

Binary Quadratic Programming ◽

Download Full-text

A new branch and bound method with pretreatment for the binary quadratic programming

Applied Mathematics and Computation ◽

10.1016/j.amc.2007.03.006 ◽

2007 ◽

Vol 192 (1) ◽

pp. 252-259 ◽

Author(s):

Xuewen Mu ◽

Yaling Zhang ◽

Sanyang Liu

Keyword(s):

Quadratic Programming ◽

Branch And Bound ◽

Branch And Bound Method ◽

Binary Quadratic Programming

Download Full-text

A provable better Branch and Bound method for a nonconvex integer quadratic programming problem

Journal of Computer and System Sciences ◽

10.1016/j.jcss.2004.07.002 ◽

2005 ◽

Vol 70 (1) ◽

pp. 107-117 ◽

Author(s):

Wenxing Zhu

Keyword(s):

Quadratic Programming ◽

Programming Problem ◽

Branch And Bound ◽

Quadratic Programming Problem ◽

Branch And Bound Method ◽

Integer Quadratic Programming

Download Full-text

Unified solution of a non-convex SCUC problem using combination of modified Branch-and-Bound method with Quadratic Programming

Energy Conversion and Management ◽

10.1016/j.enconman.2011.07.012 ◽

2011 ◽

Vol 52 (12) ◽

pp. 3425-3432 ◽

Author(s):

M. Shafie-khah ◽

M. Parsa Moghaddam ◽

M.K. Sheikh-El-Eslami

Keyword(s):

Quadratic Programming ◽

Branch And Bound ◽

Branch And Bound Method

Download Full-text

An Iterated Greedy Algorithm for the Binary Quadratic Programming Problem

IEEJ Transactions on Electronics Information and Systems ◽

10.1541/ieejeiss.130.1089 ◽

2010 ◽

Vol 130 (6) ◽

pp. 1089-1090

Author(s):

Takenori Murakami ◽

Fubito Toyama ◽

Kenji Shoji ◽

Jyuichi Miyamichi

Keyword(s):

Quadratic Programming ◽

Programming Problem ◽

Greedy Algorithm ◽

Quadratic Programming Problem ◽

Binary Quadratic Programming ◽

Iterated Greedy Algorithm ◽

Iterated Greedy

Download Full-text

Improved SDP Bounds for Binary Quadratic Programming

RA Journal Of Applied Research ◽

10.31142/rajar/v4i6.09 ◽

2018 ◽

Vol 04 (06) ◽

Author(s):

Baiyi Wu ◽

Keyword(s):

Quadratic Programming ◽

Binary Quadratic Programming

Download Full-text

A geometric branch and bound method for robust maximization of convex functions

Journal of Global Optimization ◽

10.1007/s10898-021-01038-7 ◽

2021 ◽

Author(s):

Fengqiao Luo ◽

Sanjay Mehrotra

Keyword(s):

Branch And Bound ◽

Convex Functions ◽

Branch And Bound Method

Download Full-text

Generalized Target-Allocation Functions and their Evaluation by the Branch-And-Bound Method

Computational Mathematics and Modeling ◽

10.1007/s10598-021-09525-y ◽

2021 ◽

Author(s):

A. G. Perevozchikov ◽

V. Yu. Reshetov ◽

I. E. Yanochkin

Keyword(s):

Branch And Bound ◽

Branch And Bound Method ◽

Target Allocation

Download Full-text

Reliability optimization of a complex system by the stochastic branch and bound method

Cybernetics and Systems Analysis ◽

10.1007/s10559-008-9000-5 ◽

2008 ◽

Vol 44 (3) ◽

pp. 418-428 ◽

Author(s):

V. I. Norkin ◽

B. O. Onishchenko

Keyword(s):

Complex System ◽

Branch And Bound ◽

Reliability Optimization ◽

Branch And Bound Method

Download Full-text

A Branch-and-bound Method For The Optimal Scheduling

Proceedings of the IEEE Custom Integrated Circuits Conference ◽

10.1109/cicc.1992.591165 ◽

2005 ◽

Author(s):

Seong Yong Ohm ◽

Chu Shik Jhon

Keyword(s):

Branch And Bound ◽

Optimal Scheduling ◽

Branch And Bound Method

Download Full-text

On a lower bound on the computational complexity of a parallel implementation of the branch-and-bound method

Automation and Remote Control ◽

10.1134/s0005117910100140 ◽

2010 ◽

Vol 71 (10) ◽

pp. 2152-2161 ◽

Author(s):

R. M. Kolpakov ◽

M. A. Posypkin ◽

I. Kh. Sigal

Keyword(s):

Computational Complexity ◽

Lower Bound ◽

Branch And Bound ◽

Parallel Implementation ◽

Branch And Bound Method

Download Full-text