Error seems to unrecognize the ``[[maybe_unused]]` token with the `if
constexpr`:

error: expected unqualified-id before ‘[’ token

     debug_logger([[maybe_unused]] const std::string_view name) noexcept

lib/src/itm-common.hpp:1796:18: error: expected ‘)’ before ‘[’ token

     debug_logger([[maybe_unused]] const std::string_view name) noexcept

                 ~^

The new `cycle` option allows to cycle between every constaint order
option from `none` to `pi-sign-change`.

The value of each variables in the solution/initial vector is
initialized according to the init-policy-random parameter of the
bernouilli's law:

- 1 use the init-policy algorithm to affect 0 or 1.
- 0 use the toss up algorithm (init-random parameter and the
  bernouilli's law) to affect 0 or 1.

trying to merge new idea

to merge with bqp

Add into solvers and core API a BQP mode in objective function.

Change the initialization and reinitialization policy of the solution
vector. Values are:

* `bastert`: for each variable (or at `init-random` rate) use cost values to set
  or unset variable.
* `pessimistic-solve`: found a solution for each (or at `init-random` rate)
  constraints. For soft constraints, affect one to strict minimum variables.
* `optimistic-solve`: found a solution for each (or or `init-random` rate)
  constraints. For soft constraints, affect one to the maximum variables that
  valid the constraint.
* `cycle` (default): Only for the optimization mode, start with the
  `pessimistic-solve` mode and change to `bastert` then `pessimistic-solve`
  mode. The change between mode is done if and only if three times, optimization
  fails to improve the current solution.