mip
Modules
Runs MIP (Mixed Integer Programming) optimization and realizes the resulting model solutions. |
|
|
Solves multi-layer replacement optimization using Mixed Integer Programming. |
|
|
Normalize named MIP profiles and compile their aggregate constraints. |
|
Main entry point for running the puzzle optimization to find optimal layer configurations. |
|
Candidate-domain filtering and homogeneous Puzzletron solution ranking. |
|
MIP sweep functionality for exploring multiple memory compression rates. |
|
Utility functions for MIP optimization. |
MIP-based pruning: model optimization via mixed-integer programming.