issues
search
snowberryfield
/
printemps
C++ metaheuristics modeler/solver for general integer optimization problems.
https://snowberryfield.github.io/printemps/
MIT License
45
stars
3
forks
source link
Full refactor
#192
Closed
snowberryfield
closed
2 years ago
snowberryfield
commented
2 years ago
This PR includes the following features:
Refactors the entire program was with
C++17
.
Changes the option API, which
does not maintain backward compatibility
.
Transfers the codes of standalone MPS solver as an independent class.
Changes the standard output contents and style.
Incorporates the redundant set variables/constraints extractor and the implicit equality constraint extractor in presolving.
Adds new constraint types were introduced with special neighborhood moves:
Exclusive OR: $x_1 + x_2 = 1 \enspace (x_1, x_2 \in {0,1})$
Exclusive NOR: $x_1 = x_2 \enspace (x_1, x_2 \in {0,1})$
Inverted Integers: $x_1 = - x_2 \enspace (x_1, x_2 \in \mathbb{Z})$
Balanced Integers: $x_1 = x_2 \enspace (x_1, x_2 \in \mathbb{Z})$
Constant Sum Integers: $x_1 + x_2 = c \enspace (x_1, x_2, c \in \mathbb{Z})$
Constant Difference Integers: $x_1 - x_2 = c \enspace (x_1, x_2, c \in \mathbb{Z})$
Constant Ratio Integers: $x_1 = c x_2 \enspace (x_1, x_2, c \in \mathbb{Z})$
Trinomial Exclusive NOR: $x_1 + x_2 = y \enspace (x_1, x_2, y \in {0,1})$
This PR includes the following features:
C++17
.