Corpus ID: 20068017

Logical and Inequality Implications for Reducing the Size and Complexity of Quadratic Unconstrained Binary Optimization Problems

@article{Glover2017LogicalAI,
  title={Logical and Inequality Implications for Reducing the Size and Complexity of Quadratic Unconstrained Binary Optimization Problems},
  author={Fred W. Glover and Mark W. Lewis and Gary A. Kochenberger},
  journal={ArXiv},
  year={2017},
  volume={abs/1705.09545}
}
  • Fred W. Glover, Mark W. Lewis, Gary A. Kochenberger
  • Published in ArXiv 2017
  • Computer Science
  • The quadratic unconstrained binary optimization (QUBO) problem arises in diverse optimization applications ranging from Ising spin problems to classical problems in graph theory and binary discrete optimization. The use of preprocessing to transform the graph representing the QUBO problem into a smaller equivalent graph is important for improving solution quality and time for both exact and metaheuristic algorithms and is a step towards mapping large scale QUBO to hardware graphs used in… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    4
    Twitter Mentions

    References

    Publications referenced by this paper.
    SHOWING 1-8 OF 8 REFERENCES

    The unconstrained binary quadratic programming problem: a survey

    VIEW 1 EXCERPT

    Fast clique minor generation in Chimera qubit connectivity graphs

    Analyzing quadratic unconstrained binary optimization problems via multicommodity flows

    VIEW 1 EXCERPT

    Minor-embedding in adiabatic quantum computation: I. The parameter setting problem

    • Vicky Choi
    • Physics, Mathematics, Computer Science
    • Quantum Information Processing
    • 2008

    Design and Analysis of Experiments

    • D. C. Montgomery
    • programming. Computing,
    • 1984