Integrating pivot based search with branch and bound for binary MIPs
暂无分享,去创建一个
[1] David L. Woodruff,et al. Scatter Search to Generate Diverse MIP Solutions , 2000 .
[2] F. Glover,et al. Candidate List and Exploration Strategies for Solving 0/1 Mip Problems Using a Pivot Neighborhood , 1999 .
[3] David L. Woodruff,et al. Proposals for chunking and tabu search , 1998, Eur. J. Oper. Res..
[4] David L. Woodruff,et al. Chunking Applied to Reactive Tabu Search , 1996 .
[5] Fred Glover,et al. Probabilistic Move Selection in Tabu Search for Zero-One Mixed Integer Programming Problems , 1996 .
[6] Kurt Jörnsten,et al. Tabu search within a pivot and complement framework , 1994 .
[7] Kurt Jörnsten,et al. Tabu Search for General Zero-One Integer Programs Using the Pivot and Complement Heuristic , 1994, INFORMS J. Comput..
[8] R. Tyrrell Rockafellar,et al. Scenarios and Policy Aggregation in Optimization Under Uncertainty , 1991, Math. Oper. Res..
[9] George L. Nemhauser,et al. Functional description of MINTO : a mixed integer optimizer , 1991 .