Comparing QUBO models for quantum annealing: integer encodings for permutation problems

DOI10.1111/ITOR.13471MaRDI QIDQ6609696zbMATH OpenFDO

Authors Philippe Codognet

Publication date 24 September 2024

Published in International Transactions in Operational Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1111/ITOR.13471

zbMATH Keywords

constrained optimizationconstraint satisfactioninteger encodingquantum annealingQUBO

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites work

• A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem
• A survey for the quadratic assignment problem
• A unified framework for modeling and solving combinatorial optimization problems: a tutorial
• A unified modeling and solution framework for combinatorial optimization problems
• Application of exact and heuristic methods to magic square problem
• Assignment Problems and the Location of Economic Activities
• Combinatorial optimization by simulating adiabatic bifurcations in nonlinear Hamiltonian systems
• Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems
• Exact sampling and counting for fixed-margin matrices
• From the quantum approximate optimization algorithm to a quantum alternating operator ansatz
• Generalised arc consistency for the AllDifferent constraint: an empirical survey
• scientific article; zbMATH DE number 3249560 (Why is no real title available?)
• Large-scale parallelism for constraint-based local search: the costas array case study
• Minor-embedding in adiabatic quantum computation. I: The parameter setting problem
• Minor-embedding in adiabatic quantum computation. II: Minor-universal graph design
• New advances for quantum-inspired optimization
• Penalty and partitioning techniques to improve performance of QUBO solvers
• Penalty weights in QUBO formulations: permutation problems
• Pseudo-Boolean optimization
• QAPLIB-A quadratic assignment problem library
• Quadratic assignment problems
• Quantum bridge analytics. I: A tutorial on formulating and using QUBO models
• The unconstrained binary quadratic programming problem: a survey

Cited in

(1)

• Quantum annealing-driven branch and bound for the total weighted tardiness traveling salesman problem on the D-wave quantum computer

This page was built for publication: Comparing QUBO models for quantum annealing: integer encodings for permutation problems

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