Understanding the Usage of QUBO-based Hamiltonian Function in Combinatorial Optimization over Graphs: A Discussion Using Max Cut (MC) Problem.
Redwan Ahmed RizveeMd. Mosaddek KhanPublished in: CoRR (2023)
Keyphrases
- combinatorial optimization
- max cut
- np complete problems
- graph coloring
- combinatorial problems
- graph model
- combinatorial optimization problems
- planar graphs
- simulated annealing
- traveling salesman problem
- metaheuristic
- spectral graph
- branch and bound
- graph partitioning
- np hard
- optimization problems
- graph theory
- branch and bound algorithm
- vehicle routing problem
- neural network
- phase transition
- job shop scheduling problem
- artificial bee colony
- job shop scheduling
- theoretic framework
- upper bound
- multiscale
- clustering algorithm
- genetic algorithm