Solving the minimum sum coloring problem : alternative models, exact solvers, and metaheuristics
Year of publication: |
2025
|
---|---|
Authors: | Du, Yu ; Glover, Fred ; Kochenberger, Gary ; Hennig, Rick ; Wang, Haibo ; Hulandageri, Amit |
Published in: |
INFORMS journal on computing : JOC ; charting new directions in operations research and computer science ; a journal of the Institute for Operations Research and the Management Sciences. - Linthicum, Md. : INFORMS, ISSN 1526-5528, ZDB-ID 2004082-9. - Vol. 37.2025, 2, p. 199-211
|
Subject: | combinatorial optimization | constraint programming | metaheuristics | minimum sum coloring problem | quadratic unconstrained binary optimization | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Heuristik | Heuristics | Scheduling-Verfahren | Scheduling problem |
-
The Quadratic Unconstrained Binary Optimization Problem : Theory, Algorithms, and Applications
Punnen, Abraham P., (2022)
-
Toward unification of exact and heuristic optimization methods
Hooker, J. N., (2015)
-
Metaheuristics : the metaphor exposed
Sörensen, Kenneth, (2015)
- More ...
-
New advances for quantum-inspired optimization
Du, Yu, (2025)
-
A computational study on the quadratic knapsack problem with multiple constraints
Wang, Haibo, (2012)
-
Quantum bridge analytics I, a tutorial on formulating and using qubo models
Glover, Fred, (2019)
- More ...