Sufficient optimal conditions for unconstrained quadratic binary problems
Sufficient optimal conditions for unconstrained quadratic binary problems
- Author(s): Liu Liu ; Chunli Liu ; Qiuling Xie
- DOI: 10.1049/cp.2015.0623
For access to this article, please select a purchase option:
Buy conference paper PDF
Buy Knowledge Pack
IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.
12th International Symposium on Operations Research and its Applications in Engineering, Technology and Management (ISORA 2015) — Recommend this title to your library
Thank you
Your recommendation has been sent to your librarian.
- Author(s): Liu Liu ; Chunli Liu ; Qiuling Xie Source: 12th International Symposium on Operations Research and its Applications in Engineering, Technology and Management (ISORA 2015), 2015 page ()
- Conference: 12th International Symposium on Operations Research and its Applications in Engineering, Technology and Management (ISORA 2015)
- DOI: 10.1049/cp.2015.0623
- ISBN: 978-1-78561-085-1
- Location: Luoyang, China
- Conference date: 21-24 Aug. 2015
- Format: PDF
In this article, we present several sufficient optimal conditions for unconstrained quadratic binary problems, which can be applied in algorithms combining with SDP relaxations in branch-and-bound approaches for the primal problem. These optimal conditions can work for many situations when the Lagrangian duality gap is not zero.
Inspec keywords: quadratic programming; tree searching
Subjects: Optimisation; Optimisation techniques; Combinatorial mathematics; Optimisation techniques; Combinatorial mathematics; Combinatorial mathematics
Related content
content/conferences/10.1049/cp.2015.0623
pub_keyword,iet_inspecKeyword,pub_concept
6
6