A preprocessing technique for quadratic unconstrained binary optimization

To solve combinatorial optimization problems more easily, it can be valuable to identify a set of necessary or sufficient conditions that an optimal solution of the problem must satisfy. For instance, weak and strong duality conditions in linear programming support the development of the well-known...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Discrete optimization Jg. 58; S. 100914
Hauptverfasser:	Gueye, S., Michelon, P.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 01.11.2025 Elsevier
Schlagworte:	Combinatorial optimization Computer Science Constraint programming Karush–Kuhn–Tucker conditions Operations Research Persistencies Quadratic unconstrained binary optimization Combinatorial optimization 90Cxx Karush–Kuhn–Tucker conditions Constraint programming Quadratic unconstrained binary optimization Persistencies
ISSN:	1572-5286, 1873-636X
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!