QUBO Software

Brad D. Woods (), Gary Kochenberger () and Abraham P. Punnen ()
Additional contact information
Brad D. Woods: 1Qbit Inc.
Gary Kochenberger: Entanglement, Inc.
Abraham P. Punnen: Simon Fraser University

Chapter Chapter 11 in The Quadratic Unconstrained Binary Optimization Problem, 2022, pp 301-311 from Springer

Abstract: Abstract In this chapter, we compile information regarding various QUBO solvers available. This includes general purpose MILP solvers, SDP solvers, codes for heuristics, exact algorithms, and test instances. We include information on solvers and test instances for problems that are equivalent to QUBO and the equivalent formulation can be obtained directly without significant effort. This includes the maximum cut problem, the maximum weight stable set problem, the maximum clique problem, and bilinear programs.

Date: 2022
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-031-04520-2_11

Ordering information: This item can be ordered from
http://www.springer.com/9783031045202

DOI: 10.1007/978-3-031-04520-2_11

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().