Filters








2 Hits in 5.8 sec

Bound reduction using pairs of linear inequalities

Pietro Belotti
2012 Journal of Global Optimization  
Hauser, "Randomized relaxation methods for the maximum feasible subsystem problem," Proceedings of the 11th International Conference on Integer Programming and Combinatorial Optimization (IPCO 2005), 259  ...  -264, Berlin, Germany (June 2005). 5.  ... 
doi:10.1007/s10898-012-9848-9 fatcat:vmkefad6sreqzdwi5okrolvc5m

A Mathematical Bibliography of Signed and Gain Graphs and Allied Areas Compiled by

Thomas Zaslavsky
1996 unpublished
., Integer Programming and Combinatorial Optimization (11th Int. IPCO Conf., IPCO 2005, Berlin), pp. 35-50. Lect. Notes in Computer Sci., Vol. 3509. Springer, Berlin, 2005. MR 2210011 (2006j:90108).  ...  In: Egon Balas and Jens Clausen, eds., Integer Programming and Combinatorial Optimization (4th Int. IPCO Conf., Copenhagen, 1995, Proc.) , Notes in Computer Sci., Vol. 920. Springer, Berlin, 1995.  ...  Sewell 1996a Binary integer programs with two variables per inequality. Math. Programming 75 (1996) , Ser. A, 467-476. MR 97m:90059. Zbl 874.90138.  ... 
fatcat:os5lveptfbbbplmcy4drb2zd3m