Reinforcement Learning-Based Formulations With Hamiltonian-Inspired Loss Functions for Combinatorial Optimization Over Graphs
Quadratic Unconstrained Binary Optimization (QUBO) is a versatile approach used to represent a wide range of NP-hard Combinatorial Optimization (CO) problems through binary variables. The transformation of QUBO to an Ising Hamiltonian is recognized as an effective method for solving key optimization...
Saved in:
| Main Authors: | Redwan Ahmed Rizvee, Raheeb Hassan, Md. Mosaddek Khan |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2024-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/10752916/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
The harmonic index and some Hamiltonian properties of graphs
by: Rao Li
Published: (2024-12-01) -
Bounds of the forgotten topological index and some Hamiltonian properties of graphs
by: Rao Li
Published: (2024-12-01) -
Hamiltonian-connected graphs and their strong closures
by: Pak-Ken Wong
Published: (1997-01-01) -
The First Zagreb Index and Some Hamiltonian Properties of Graphs
by: Rao Li
Published: (2024-12-01) -
CONDITIONS FOR GRAPHS ON n VERTICES WITH THE SUM OF DEGREES OF ANY TWO NONADJACENT VERTICES EQUAL TO n-2 TO BE A HAMILTONIAN GRAPH
by: Nhu An Do, et al.
Published: (2024-02-01)