The Lagrangian problem can thus be used in place of a linear programming relaxation to provide bounds in a branch and bound algorithm. This approach has led to dramatically improved algorithms for a ...

Ellis L. Johnson, Michael M. Kostreva, Uwe H. Suhl, Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models, Operations Research, Vol. 33, No. 4 (Jul. - Aug., 1985), pp.

Victor Reis helped create a new algorithm that solves integer linear programming problems in record time. Maryna Viazovska. That’s not to say it’s easy work. It wasn’t until 1983 that the ...