Leveraging special-purpose hardware for local search heuristics
From MaRDI portal
Publication:2125062
DOI10.1007/s10589-022-00354-2OpenAlexW3110558526WikidataQ113904028 ScholiaQ113904028MaRDI QIDQ2125062
Avradip Mandal, Hayato Ushijima-Mwesigwa, Sarvagya Upadhyay, Arnab Roy, Xiaoyuan Liu, Ilya Safro
Publication date: 12 April 2022
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1911.09810
Combinatorics in computer science (68R05) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Mathematical programming (90Cxx)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- QAPLIB - a quadratic assignment problem library
- Enhancing quantum annealing performance for the molecular similarity problem
- Path relinking for unconstrained binary quadratic programming
- From the quantum approximate optimization algorithm to a quantum alternating operator ansatz
- Adaptive Memory Tabu Search for Binary Quadratic Programs
- Advanced Coarsening Schemes for Graph Partitioning
- Engineering Multilevel Graph Partitioning Algorithms
- An Efficient Heuristic Procedure for Partitioning Graphs
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- An Analysis of Spectral Envelope Reduction via Quadratic Assignment Problems
- A spectral algorithm for envelope reduction of sparse matrices
- Benchmark Graphs for Practical Graph Isomorphism
- Relaxation-Based Coarsening for Multilevel Hypergraph Partitioning
- Equation of State Calculations by Fast Computing Machines
- A Multilevel Algorithm for the Minimum 2-sum Problem
- Monte Carlo sampling methods using Markov chains and their applications
- Quantum bridge analytics. I: A tutorial on formulating and using QUBO models
This page was built for publication: Leveraging special-purpose hardware for local search heuristics
