R. R. Thomas and R. Weismantel, Test sets and inequalities for integer programs, Integer Programming and Combinatorial Optimization (W. H. Cunningham, S. T. McCormick, and M. Queyranne, eds.), Lecture Notes in Computer Science, no. 1084, Springer, Berlin, 1996, Proceedings of the 5th International IPCO Conference, pp. 16 -- 30.  Home/Search   Document Not in Database   Summary   Related Articles

.... An extended abstract of this work appeared in the Proceedings of the 10th Annual ACM SIAM Symposium on Discrete Algorithms [16] 1 2 1 Introduction During the last ten years, there has been a strong, renewed interest in so called test sets for integer programming problems, see, e.g. [2, 3, 8, 21, 22, 23, 24, 25]. This research has not only led to stimulating new insights, but it has also raised new questions. Prompted by the more abstract point of view, these questions often involve natural generalizations of concepts used in the design of primal algorithms for specific combinatorial optimization ....

R. R. Thomas and R. Weismantel, Test sets and inequalities for integer programs, Integer Programming and Combinatorial Optimization (W. H. Cunningham, S. T. McCormick, and M. Queyranne, eds.), Lecture Notes in Computer Science, no. 1084, Springer, Berlin, 1996, Proceedings of the 5th International IPCO Conference, pp. 16 -- 30.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC