Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems
Year of publication: |
16 March 2018
|
---|---|
Authors: | Glover, Fred ; Lewis, Mark ; Kochenberger, Gary |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 265.2018, 3 (16.3.), p. 829-842
|
Subject: | Combinatorial optimization | Quadratic unconstrained binary optimization | Preprocessing | Graph reduction | Quantum annealing | Theorie | Theory | Mathematische Optimierung | Mathematical programming |
-
The Quadratic Unconstrained Binary Optimization Problem : Theory, Algorithms, and Applications
Punnen, Abraham P., (2022)
-
A large population island framework for the unconstrained binary quadratic problem
Goudet, Olivier, (2024)
-
Solving the type-2 assembly line balancing with setups using logic-based benders decomposition
Zohali, Hassan, (2022)
- More ...
-
GRAPH BISECTION MODELED AS CARDINALITY CONSTRAINED BINARY QUADRATIC TASK ALLOCATION
LEWIS, MARK, (2013)
-
Using to model and solve the uncapacitated task allocation problem
Lewis, Mark, (2005)
-
A new approach for modeling and solving set packing problems
Alidaee, Bahram, (2008)
- More ...