A max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)-Reference-Cited by-同舟云学术

A max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)

Published:2008-05 Issue:2 Volume:5 Page:501-529
ISSN:1572-5286
Container-title:Discrete Optimization
language:en
Short-container-title:Discrete Optimization

Author:

Boros Endre,Hammer Peter L.,Sun Richard,Tavares Gabriel

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Theory and Mathematics,Theoretical Computer Science

Reference44 articles.

1. On the equivalence between roof duality and lagrangian duality for unconstrained 0–1 quadratic programming;Adams;Discrete Applied Mathematics,1994

2. A linear time algorithm for testing the truth of certain quantified boolean formulas;Aspvall;Information Processing Letters,1979

3. The max-cut problem in graphs not contractible to k5;Barahona;Operations Research Letters,1983

4. J.E. Beasley, Heuristic algorithms for the unconstrained binary quadratic programming problem, Tech. Rep., Management School, Imperial College, London, UK, 1998

5. Solving large-scale sparse semidefinite programs for combinatorial optimization;Benson;SIAM Journal on Optimization,2000

Cited by 38 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Collaborative Neurodynamic Algorithm for Quadratic Unconstrained Binary Optimization;IEEE Transactions on Emerging Topics in Computational Intelligence;2024

2. Constructing the Neighborhood Structure of VNS Based on Binomial Distribution for Solving QUBO Problems;Algorithms;2022-06-02

3. Quantum bridge analytics I: a tutorial on formulating and using QUBO models;Annals of Operations Research;2022-04-07

4. Penalty Weights in QUBO Formulations: Permutation Problems;Evolutionary Computation in Combinatorial Optimization;2022

5. Autarkies and Persistencies for QUBO;The Quadratic Unconstrained Binary Optimization Problem;2022