Abstract
This paper describes several tactics (including batch branching) for employing a directed tree search strategy to find a binary vector slated to optimize a linear function. Certain tactics are especially useful when interfacing with an LP system to guide the tree search.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
