Discrete Programming Applications of Techniques for Handling a Common List Structure.

It is pointed out how two list-handling algorithms, heapsort and balanced tree search, can accelerate incremental allocation and branch and bound algorithms--in particular certain integer programming algorithms. The use of incremental allocation and...