An optimality cut for mixed integer linear programs.

Gilbert Laporte Frédéric Semet

Published in: Eur. J. Oper. Res. (1999)

Keyphrases

mixed integer linear programs
cutting plane algorithm
optimal solution
continuous relaxation
valid inequalities
vehicle routing problem
branch and bound search
computational complexity
integer variables
evolutionary algorithm
probabilistic model
linear programming