Suchergebnisse - binary quadratic constrained programming

  1. 1

    Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint von Zheng, Xiaojin, Pan, Yutong, Cui, Xueting

    ISSN: 0925-5001, 1573-2916
    Veröffentlicht: New York Springer US 01.04.2018
    Veröffentlicht in Journal of global optimization (01.04.2018)
    “… We investigate in this paper nonconvex binary quadratically constrained quadratic programming (QCQP …”
    Volltext
    Journal Article
  2. 2

    Polynomial time solvable algorithms to a class of unconstrained and linearly constrained binary quadratic programming problems von Gu, Shenshen, Cui, Rui, Peng, Jiao

    ISSN: 0925-2312, 1872-8286
    Veröffentlicht: Elsevier B.V 19.07.2016
    Veröffentlicht in Neurocomputing (Amsterdam) (19.07.2016)
    “… However, it is NP-hard and lacks efficient algorithms. Due to this reason, in this paper, some novel polynomial algorithms are proposed to solve a class of unconstrained and linearly constrained binary quadratic programming problems …”
    Volltext
    Journal Article
  3. 3

    On linearization techniques for budget-constrained binary quadratic programming problems von Yang, Mei-Jia, Xia, Yong, Zou, Hui-Min

    ISSN: 0167-6377, 1872-7468
    Veröffentlicht: Elsevier B.V 01.11.2016
    Veröffentlicht in Operations research letters (01.11.2016)
    “… Glover’s linearization technique is revisited for solving the binary quadratic programming problem with a budget constraint (BBQP …”
    Volltext
    Journal Article
  4. 4

    An improved lower bound and approximation algorithm for binary constrained quadratic programming problem von Lu, Cheng, Wang, Zhenbo, Xing, Wenxun

    ISSN: 0925-5001, 1573-2916
    Veröffentlicht: Boston Springer US 01.11.2010
    Veröffentlicht in Journal of global optimization (01.11.2010)
    “… This paper presents an improved lower bound and an approximation algorithm based on spectral decomposition for the binary constrained quadratic programming problem …”
    Volltext
    Journal Article
  5. 5

    An evaluation of semidefinite programming based approaches for discrete lot-sizing problems von Gicquel, C., Lisser, A., Minoux, M.

    ISSN: 0377-2217, 1872-6860
    Veröffentlicht: Amsterdam Elsevier B.V 01.09.2014
    Veröffentlicht in European journal of operational research (01.09.2014)
    “… •This problem is formulated as a quadratically constrained quadratic binary program.•We compute lower bounds using a semidefinite rather than a linear relaxation …”
    Volltext
    Journal Article
  6. 6

    Semidefinite Programming Relaxation Based Virtually Antipodal Detection for MIMO Systems Using Gray-Coded High-Order QAM von Shaoshi Yang, Tiejun Lv, Hanzo, L.

    ISSN: 0018-9545, 1939-9359
    Veröffentlicht: New York, NY IEEE 01.05.2013
    Veröffentlicht in IEEE transactions on vehicular technology (01.05.2013)
    “… An efficient generalized semidefinite programming relaxation (SDPR) based virtually antipodal (VA …”
    Volltext
    Journal Article
  7. 7

    Binary classification posed as a quadratically constrained quadratic programming and solved using particle swarm optimization von KUMAR, DEEPAK, RAMAKRISHNAN, A G

    ISSN: 0256-2499, 0973-7677
    Veröffentlicht: New Delhi Springer India 01.03.2016
    Veröffentlicht in Sadhana (Bangalore) (01.03.2016)
    “… Binary classification is posed as a quadratically constrained quadratic problem and solved using the proposed method …”
    Volltext
    Journal Article
  8. 8
  9. 9
  10. 10

    Polynomial time solvable algorithm to linearly constrained binary quadratic programming problems with Q being a five-diagonal matrix von Shenshen Gu, Rui Cui

    ISBN: 1479936499, 9781479936496
    Veröffentlicht: IEEE 01.08.2014
    “… Binary quadratic programming (BQP) is a typical integer programming problem widely applied in the field of signal processing, economy, management and engineering …”
    Volltext
    Tagungsbericht
  11. 11
  12. 12

    A quadratic semidefinite relaxation approach for resource allocation in orthogonal frequency division multiple access von Adasme, Pablo, Lisser, Abdel, Soto, Ismael

    ISSN: 0028-3045, 1097-0037
    Veröffentlicht: Hoboken Wiley Subscription Services, Inc., A Wiley Company 01.01.2012
    Veröffentlicht in Networks (01.01.2012)
    “… This paper proposes two binary quadratically constrained quadratic programs for minimizing power subject to bit rate and subcarrier allocation constraints over wireless orthogonal frequency division multiple access …”
    Volltext
    Journal Article
  13. 13

    A subgradient approach for constrained binary optimization via quantum adiabatic evolution von Karimi, Sahar, Ronagh, Pooya

    ISSN: 1570-0755, 1573-1332
    Veröffentlicht: New York Springer US 01.08.2017
    Veröffentlicht in Quantum information processing (01.08.2017)
    “… Outer approximation method has been proposed for solving the Lagrangian dual of a constrained binary quadratic programming problem via quantum adiabatic evolution in the literature …”
    Volltext
    Journal Article
  14. 14

    Array spatial thinning for interference mitigation by semidefinite programming von Nosrati, Hamed, Aboutanios, Elias, Smith, David B.

    ISSN: 2076-1465
    Veröffentlicht: EURASIP 01.08.2017
    “… This optimization is a binary quadratic non-convex minimization. We propose a semidefinite programming method to find suboptimal solutions using an optimal randomized sampling strategy …”
    Volltext
    Tagungsbericht
  15. 15

    Mining for diamonds—Matrix generation algorithms for binary quadratically constrained quadratic problems von Bettiol, Enrico, Bomze, Immanuel, Létocart, Lucas, Rinaldi, Francesco, Traversi, Emiliano

    ISSN: 0305-0548, 1873-765X, 0305-0548
    Veröffentlicht: New York Elsevier Ltd 01.06.2022
    Veröffentlicht in Computers & operations research (01.06.2022)
    “… In this paper, we consider binary quadratically constrained quadratic problems and propose a new approach to generate stronger bounds than the ones obtained using the Semidefinite Programming relaxation …”
    Volltext
    Journal Article
  16. 16

    Optimal placement of multi-wavelength integrated tunable transmitters in reconfigurable optical data center interconnection networks with multi-hop routing von Zhu, Jiawen, Chen, Baojun, Sun, Weiqiang, Ye, Tong, Hu, Weisheng

    ISSN: 1943-0620, 1943-0639
    Veröffentlicht: Piscataway Optica Publishing Group 01.08.2025
    Veröffentlicht in Journal of optical communications and networking (01.08.2025)
    “… Circuit-switched technologies have created the enticing possibility of guaranteeing the performance of data center networks under bursty and skewed traffic. In …”
    Volltext
    Journal Article
  17. 17

    Sensing Coverage Enhancement of Cellular Networks Via Mutual Interference Suppression von Wang, Bowen, Li, Nanxi, Zhu, Jianchi, She, Xiaoming, Chen, Peng

    ISSN: 1882-5621
    Veröffentlicht: IEEE 17.11.2024
    “… constrained binary quadratic programming instance, accounting for mutual interference among base stations …”
    Volltext
    Tagungsbericht
  18. 18

    Semidefinite Approximation for Mixed Binary Quadratically Constrained Quadratic Programs von Xu, Zi, Hong, Mingyi, Luo, Zhi-Quan

    ISSN: 1052-6234, 1095-7189
    Veröffentlicht: Philadelphia Society for Industrial and Applied Mathematics 01.01.2014
    Veröffentlicht in SIAM journal on optimization (01.01.2014)
    “… ) relaxation techniques for some mixed binary quadratically constrained quadratic programs (MBQCQP) and analyzes their approximation performance …”
    Volltext
    Journal Article
  19. 19

    A fast global algorithm for singly linearly constrained separable binary quadratic program with partially identical parameters von Lu, Cheng, Wu, Junhao, Deng, Zhibin, Li, Shaoze

    ISSN: 1862-4472, 1862-4480
    Veröffentlicht: Berlin/Heidelberg Springer Berlin Heidelberg 01.04.2023
    Veröffentlicht in Optimization letters (01.04.2023)
    “… The singly linearly constrained separable binary quadratic programming problem (SLSBQP) has a wide variety of applications in practice …”
    Volltext
    Journal Article
  20. 20

    Semidefinite Programming Relaxation Based Virtually Antipodal Detection for Gray Coded 16-QAM MIMO Signalling von Shaoshi Yang, Hanzo, L.

    ISBN: 9781424492664, 1424492661
    ISSN: 1930-529X
    Veröffentlicht: IEEE 01.12.2011
    “… An efficient semidefinite programming relaxation (SDPR) based virtually antipodal (VA …”
    Volltext
    Tagungsbericht