Learn More
Integer programming algorithms based on the ordered enumeration method are described. Combining dynamic programming and branch and bound ideas in one efficient computational process, S. S. Lebedev implemented his method for solving integer linear programming problems in 1968. A number of ordered enumeration algorithms were developed since the 1970's. The(More)
  • 1