SOME TACTICS FOR 0-1 PROGRAFIMING By H a r v e y J. Greenberg, M a n a g e m e n t S c i e n c e Systems & James E. Kalan, S t a n f o r d Univ. ABSTRACT This p a p e r describes s e v e r a l tactics (including b a t c h branching) for e m p l o y i n g a d i r e c t e d tree s e a r c h strategy to find a b i n a r y v e c t o r s l a t e d to optimize a linear function. C e r t a i n tactics are e s p e c i a l l y useful when i n t e r f a c i n g w i t h an LP system to guide the tree search. INTRODUCTION: The p r o l i f i c a t i o n of literature d e a l i n g w i t h the many aspects of 0-i
/lp/association-for-computing-machinery/some-tactics-for-0-1-programming-8kOkAOn7sH