arXiv · 2303.15643
Density Matrix Minimization Meets a Combinatorial Optimization Problem
Abstract
This study investigates a new hybrid method for solving the combinatorial problem of optimizing fractional functions with 0-1 binary variables. The method combines density matrix minimization (DMM), tabu search (TS), and the Dinkelbach algorithm to optimize fractional functions. Although DMM alone did not provide a sufficiently accurate solution, combining DMM with TS significantly improved the accuracy.
Explore related subjects
Keep this discovery
Yasuharu Okamoto. 2023-03-27. Density Matrix Minimization Meets a Combinatorial Optimization Problem. https://arxiv.org/abs/2303.15643
Cite the original work for its findings. Save a collection to share your selection of sources.