Autarkies and Persistencies for QUBO

Endre Boros ()
Additional contact information
Endre Boros: Rutgers University

Chapter Chapter 5 in The Quadratic Unconstrained Binary Optimization Problem, 2022, pp 121-137 from Springer

Abstract: Abstract In many classes of discrete optimization problems, we do not know (yet) an efficient algorithm that would guarantee an optimal solution for all instances. However, for some instances we may be able to identify provably optimal values for some of its variables. Persistency and autarky are properties of partial assignments that allow us to argue about their optimality. This chapter investigates these and some related notions from the literature and recalls algorithms for their recognition. These techniques provide efficient pre-processing for QUBO problems and in some applications these result in substantial reduction in problem sizes.

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_5

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

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

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 ().