| 123456789101112131415 |
- Unconstrained Binary Quadratic Programming
- ==========================================
- Given a collection of :math:`n` items such that each pair of items is associated with a profit value that can be positive, negative or zero, unconstrained binary quadratic programming (UBQP) seeks a subset of items that maximizes the sum of their paired values. The value of a pair is accumulated in the sum only if the two corresponding items are selected.
- The UBQP problem will be tackle in this example.
- .. toctree::
- :maxdepth: 1
- :numbered:
- :caption: Contents:
- problem
- instance
- implementation
|
