Fast numerical solver of Ising optimization problems via pruning and domain selection

DOI10.1016/J.JFRANKLIN.2025.107945MaRDI QIDQ6837069zbMATH OpenFDO

Authors Langyu Li, Daoyi Dong, Yu Pan

Publication date 26 March 2026

Published in Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JFRANKLIN.2025.107945

zbMATH Keywords

combinatorial optimizationsimulated quantum annealingquantum-inspired algorithmIsing machine

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Quantum computation (81P68) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Cites work

• scientific article; zbMATH DE number 4048925 (Why is no real title available?)
• scientific article; zbMATH DE number 775283 (Why is no real title available?)
• A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem
• Beitrag zur Theorie des Ferromagnetismus
• Branch-and-Bound Methods: General Formulation and Properties
• Generalized networks: the theory of preprocessing and an empirical analysis
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems
• On the complexity of inverse mixed integer linear optimization
• Quadratic unconstrained binary optimization problem preprocessing: theory and empirical analysis
• Quantum bridge analytics. I: A tutorial on formulating and using QUBO models

This page was built for publication: Fast numerical solver of Ising optimization problems via pruning and domain selection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6837069)