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

Celý popis

Podrobná bibliografia

Vydané v:	Discrete optimization Ročník 58; s. 100914
Hlavní autori:	Gueye, S., Michelon, P.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.11.2025 Elsevier
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!