Comparing QUBO models for quantum annealing: integer encodings for permutation problems
From MaRDI portal
Publication:6609696
DOI10.1111/itor.13471MaRDI QIDQ6609696
Publication date: 24 September 2024
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Exact sampling and counting for fixed-margin matrices
- The unconstrained binary quadratic programming problem: a survey
- Minor-embedding in adiabatic quantum computation. II: Minor-universal graph design
- Quadratic assignment problems
- Pseudo-Boolean optimization
- QAPLIB-A quadratic assignment problem library
- A survey for the quadratic assignment problem
- Minor-embedding in adiabatic quantum computation. I: The parameter setting problem
- Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems
- A unified modeling and solution framework for combinatorial optimization problems
- Penalty weights in QUBO formulations: permutation problems
- Large-scale parallelism for constraint-based local search: the costas array case study
- Generalised arc consistency for the AllDifferent constraint: an empirical survey
- From the quantum approximate optimization algorithm to a quantum alternating operator ansatz
- Penalty and partitioning techniques to improve performance of QUBO solvers
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
- Assignment Problems and the Location of Economic Activities
- Combinatorial optimization by simulating adiabatic bifurcations in nonlinear Hamiltonian systems
- Quantum bridge analytics. I: A tutorial on formulating and using QUBO models
- New advances for quantum-inspired optimization
This page was built for publication: Comparing QUBO models for quantum annealing: integer encodings for permutation problems
