Introduction to QUBO
From MaRDI portal
Publication:5050141
DOI10.1007/978-3-031-04520-2_1zbMATH Open1506.90197OpenAlexW4285032669MaRDI QIDQ5050141FDOQ5050141
Authors: Abraham P. Punnen 
Publication date: 15 November 2022
Published in: The Quadratic Unconstrained Binary Optimization Problem (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-04520-2_1
Recommendations
Cites Work
- Title not available (Why is that?)
- Positive half-products and scheduling with controllable processing times
- New results on the completion time variance minimization
- Minimization of half-products
- Algorithms for minclique scheduling problems
- A semidefinite programming approach to side chain positioning with new rounding strategies
- 50 Years of Integer Programming 1958-2008
- Pseudo-Boolean optimization
- The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
- The unconstrained binary quadratic programming problem: a survey
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Title not available (Why is that?)
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Title not available (Why is that?)
- On the Significance of Solving Linear Programming Problems with Some Integer Variables
- Roof duality, complementation and persistency in quadratic 0–1 optimization
- Algorithms - ESA 2003
- A new approach to the minimum cut problem
- Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
- Maximization of A convex quadratic function under linear constraints
- Title not available (Why is that?)
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
- Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm
- On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
- Title not available (Why is that?)
- A Selection Problem of Shared Fixed Costs and Network Flows
- Discriminative models for multi-class object layout
- MAXIMIZING A CONVEX QUADRATIC FUNCTION OVER A HYPERCUBE
- Mixed-integer quadratic programming
- Partitioning planar graphs: a fast combinatorial approach for max-cut
- History of the Lenz-Ising model 1950-1965: from irrelevance to relevance
- History of the Lenz-Ising Model 1920--1950: from Ferromagnetic to Cooperative Phenomena
- Modeling Brain Function
- History of the Lenz-Ising model 1965--1971: the role of a simple model in understanding critical phenomena
- The Generalized Lattice-Point Problem
- Optimal cell flipping to minimize channel density in VLSI design and pseudo-Boolean optimization
- Title not available (Why is that?)
- Technical Note—Linearization in 0-1 Variables: A Clarification
- The orientation of modules based on graph decomposition
- The origin of the method of steepest descent
- The generalized vertex cover problem and some variations
- Representations of quadratic combinatorial optimization problems: a case study using quadratic set covering and quadratic knapsack problems
- Linear Programming
- Integer Linear Programming in Computational and Systems Biology
- A unified framework for modeling and solving combinatorial optimization problems: a tutorial
Cited In (7)
- QUBO formulation for the contact map overlap problem
- The random QUBO
- The quadratic unconstrained binary optimization problem. Theory, algorithms, and applications
- The bipartite QUBO
- Complexity and polynomially solvable special cases of QUBO
- QUBO formulations of the longest path problem
- Introduction to Quivers
This page was built for publication: Introduction to QUBO
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5050141)
