Discrete optimization: a quantum revolution?
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 193499 (Why is no real title available?)
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- scientific article; zbMATH DE number 3034946 (Why is no real title available?)
- A novel dynamic programming heuristic for the quadratic knapsack problem
- An efficient design of reversible multi-bit quantum comparator via only a single ancillary bit
- An introduction to quantum computing, without the physics
- Application of quantum approximate optimization algorithm to job shop scheduling problem
- Discrete-variable extremum problems
- Integer Programming
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- Quantum algorithms revisited
- Quantum branch-and-bound algorithm and its application to the travelling salesman problem
- Quantum bridge analytics. I: A tutorial on formulating and using QUBO models
- Quantum computation and quantum information. 10th anniversary edition
- Quantum computational networks
- Quantum computing: an applied approach
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Rapid solution of problems by quantum computation
- Strengths and Weaknesses of Quantum Computing
- The computer as a physical system: a microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines
- The quadratic knapsack problem -- a survey
- Where are the hard knapsack problems?
- Zur Quantenmechanik der Stoßvorgänge. (Vorläufige Mitteilung.)
This page was built for publication: Discrete optimization: a quantum revolution?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6981834)
