I'm learning about algorithms related to mathematical optimization.
It seems that the exact solution of the 0-1 integer secondary plan is solved by the branch limiting method.
When I look into it, there are many problems with secondary planning of continuous variables, and I can't find them because my search ability is low.
0-1 Integer Secondary Planning Issues
https://www.letsopt.com/entry/2019/08/18/131125
It's not a paid thing like a groubiOptimizer.
Do you have a free library to solve with python?
Also, if it is a sample code, I would like to understand it and learn about it.
(Can Atcoder or anyone who is good at it write it right away?)
Fixstars provides an Amplify solver to solve the problem.Originally, it is an ising model solver, but it is also possible to model with binary (0-1 integer) variables.Constraints can also be imposed.
https://amplify.fixstars.com/ja/
You can solve the problem with a free license within the terms of use.
However, there is no guarantee that you will get a strict solution because it is a heuristic solution with annealing.
The 3.4 nonlinear function 2 from http://web.tuat.ac.jp/~miya/fujie_ORSJ.pdf describes how to eliminate the product of binary variables by adding one binary variable and three constraints to the problem.You can use this technique to linearize the problem and run a linear planning solver to find solutions to the original problem.
This method allows you to obtain a strict solution.
© 2024 OneMinuteCode. All rights reserved.