New objective space search algorithm for pure Integer Objectives
I came across the talk "Solving Multiplicative Programs by Binary-encoding the Multiplication Operation" by Dr. Hadi Charkhgard. He presents an approach for linear objectives where a variable dominates all other variables as occurs in binary encodings of integers. There are some interesting ideas in there https://www.youtube.com/watch?v=bs7oub5scX8 should such a criteria apply for the objective which seem particularly suited to Pseudo Boolean solvers but could also be generalized to MILP objectives. I thought this might be interesting.