Critical Event Tabu Search for Multidimensional Knapsack Problems
暂无分享,去创建一个
[1] S. Senju,et al. An Approach to Linear Programming with 0--1 Variables , 1968 .
[2] Fred W. Glover,et al. Solving zero-one mixed integer programming problems using tabu search , 1998, European Journal of Operational Research.
[3] F. Glover. HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS , 1977 .
[4] Richard Loulou,et al. New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem , 1979, Oper. Res..
[5] F. Glover. A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem , 1965 .
[6] Stefan Voß,et al. Dynamic tabu list management using the reverse elimination method , 1993, Ann. Oper. Res..
[7] Kathryn A. Dowsland. Modem heuristic techniques for combinatorial problems , 1993 .
[8] Fred W. Glover,et al. Tabu Thresholding: Improved Search by Nonmonotonic Trajectories , 1995, INFORMS J. Comput..
[9] A. Fréville,et al. Heuristics and reduction methods for multiple constraints 0-1 linear programming problems , 1986 .
[10] F. Glover. Tabu Search Fundamentals and Uses , 1995 .
[11] Fred W. Glover,et al. A user's guide to tabu search , 1993, Ann. Oper. Res..
[12] L. J. Savage,et al. Three Problems in Rationing Capital , 1955 .
[13] Kurt Jörnsten,et al. Tabu Search for General Zero-One Integer Programs Using the Pivot and Complement Heuristic , 1994, INFORMS J. Comput..
[14] C. Reeves. Modern heuristic techniques for combinatorial problems , 1993 .