Discrete Programming Applications of Techniques for Handling a Common List Structure.
$20.00
{{option.name}}:
{{selected_options[option.position]}}
{{value_obj.value}}
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...
Show More
Show Less