Technique for transforming discrete optimization problems into QUBO form
From MaRDI portal
Cites work
- A new approach for modeling and solving set packing problems
- A survey for the quadratic assignment problem
- A survey of local search methods for graph coloring
- An overview of computational complexity
- Colloquium: Quantum annealing and analog quantum computation
- Computational experience with a difficult mixed-integer multicommodity flow problem
- Expander flows, geometric embeddings and graph partitioning
- Graph theory
- scientific article; zbMATH DE number 6118217 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Optimization. Algorithms and applications
- Quantum bridge analytics. I: A tutorial on formulating and using QUBO models
- QUBO formulations of the longest path problem
- Rank-two relaxation heuristics for MAX-CUT and other binary quadratic programs
- Recent directions in netlist partitioning: a survey
- Reducibility among combinatorial problems
- The Kronecker product and stochastic automata networks
- The maximum clique problem
- The unconstrained binary quadratic programming problem: a survey
- Workforce scheduling and routing problems: literature survey and computational study
This page was built for publication: Technique for transforming discrete optimization problems into QUBO form
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6918369)
