Cutting and Surrogate Constraint Analysis for Improved Multidimensional Knapsack Solutions
暂无分享,去创建一个
Fred W. Glover | Peter L. Hammer | María Auxilio Osorio Lama | F. Glover | P. Hammer | M. A. O. Lama
[1] F. Glover. A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem , 1965 .
[2] Stefan Voß,et al. Dynamic tabu list management using the reverse elimination method , 1993, Ann. Oper. Res..
[3] Mara A Osorio,et al. Cuts Generation in a Branch and Cut Framework for Location Problems , 1999 .
[4] Hasan Pirkul,et al. Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality , 1985, Math. Program..
[5] Yves Crama,et al. On The Strength Of Relaxations Of Multidimensional Knapsack Problems , 1994 .
[6] John E. Beasley,et al. A Genetic Algorithm for the Multidimensional Knapsack Problem , 1998, J. Heuristics.
[7] Fred Glover,et al. Probabilistic Move Selection in Tabu Search for Zero-One Mixed Integer Programming Problems , 1996 .
[8] J. K. Lowe. Modelling with Integer Variables. , 1984 .
[9] Hong Yan,et al. Logic cuts for processing networks with fixed charges , 1994, Comput. Oper. Res..
[10] Kurt Jörnsten,et al. Tabu search within a pivot and complement framework , 1994 .
[11] Fred Glover,et al. Critical Event Tabu Search for Multidimensional Knapsack Problems , 1996 .
[12] Bruce A. McCarl,et al. A HEURISTIC FOR GENERAL INTEGER PROGRAMMING , 1974 .
[13] Saïd Hanafi,et al. An efficient tabu search approach for the 0-1 multidimensional knapsack problem , 1998, Eur. J. Oper. Res..
[14] E. Balas. An Additive Algorithm for Solving Linear Programs with Zero-One Variables , 1965 .
[15] José F. Fontanari,et al. A statistical analysis of the knapsack problem , 1995 .
[16] Paolo Toth,et al. New trends in exact algorithms for the 0-1 knapsack problem , 2000, Eur. J. Oper. Res..
[17] Peter L. Hammer,et al. Constraint Pairing In Integer Programming , 1975 .
[18] David Pisinger,et al. A Minimal Algorithm for the Bounded Knapsack Problem , 1995, IPCO.
[19] A. Victor Cabot,et al. An Enumeration Algorithm for Knapsack Problems , 1970, Oper. Res..
[20] Harvey J. Greenberg,et al. Surrogate Mathematical Programming , 1970, Oper. Res..
[21] John N. Hooker,et al. Logic-Based Methods for Optimization , 1994, PPCP.
[22] Fred Glover,et al. Flows in Arborescences , 1971 .
[23] K. Szkatuza. The growth of multi-constraint random knapsacks with large right-hand sides of the constraints , 1997, Oper. Res. Lett..
[24] Charles H. Reilly. Input models for synthetic optimization problems , 1999, WSC '99.
[25] Ralph E. Gomory,et al. The Theory and Computation of Knapsack Functions , 1966, Oper. Res..
[26] David Pisinger. A Minimal Algorithm for the Bounded Knapsack Problem , 1995, IPCO.
[27] S. Senju,et al. An Approach to Linear Programming with 0--1 Variables , 1968 .
[28] Ronald L. Rardin,et al. Some relationships between lagrangian and surrogate duality in integer programming , 1979, Math. Program..
[29] H. Martin Weingartner,et al. Methods for the Solution of the Multidimensional 0/1 Knapsack Problem , 1967, Operational Research.
[30] Paolo Toth,et al. Knapsack Problems: Algorithms and Computer Implementations , 1990 .
[31] Wei Shih,et al. A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem , 1979 .
[32] John M. Wilson,et al. Generating cuts in integer programming with families of special ordered sets , 1990 .
[33] María Auxilio Osorio Lama,et al. Mixed Logical-linear Programming , 1999, Discret. Appl. Math..
[34] Kurt Jörnsten,et al. Tabu Search for General Zero-One Integer Programs Using the Pivot and Complement Heuristic , 1994, INFORMS J. Comput..
[35] Kenneth Schilling. The growth of m-constraint random knapsacks , 1990 .
[36] Charles H. Reilly,et al. The Effects of Coefficient Correlation Structure in Two-Dimensional Knapsack Problems on Solution Procedure Performance , 2000 .
[37] Martin Dyer. Calculating surrogate constraints , 1980, Math. Program..
[38] Richard Loulou,et al. New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem , 1979, Oper. Res..
[39] Thomas Bäck,et al. The zero/one multiple knapsack problem and genetic algorithms , 1994, SAC '94.
[40] Hasan Pirkul,et al. A heuristic solution procedure for the multiconstraint zero‐one knapsack problem , 1987 .
[41] Fred W. Glover,et al. Generating Cuts from Surrogate Constraint Analysis for Zero-One and Multiple Choice Programming , 1997, Comput. Optim. Appl..
[42] Egon Balas,et al. Discrete Programming by the Filter Method , 1967, Oper. Res..
[43] Paolo Toth,et al. Algorithms and computer implementations , 1990 .
[44] A. L. Soyster,et al. Zero-one programming with many variables and few constraints , 1978 .
[45] Fred W. Glover,et al. Surrogate Constraints , 1968, Oper. Res..
[46] G. Dantzig. Discrete-Variable Extremum Problems , 1957 .
[47] Arnaud Fréville,et al. An Efficient Preprocessing Procedure for the Multidimensional 0- 1 Knapsack Problem , 1994, Discret. Appl. Math..
[48] J. P. Kelly,et al. Tabu search for the multilevel generalized assignment problem , 1995 .
[49] Krzysztof Szkatuła. The growth of multi-constraint random knapsacks with various right-hand sides of the constraints , 1994 .
[50] S. Voß,et al. Some Experiences On Solving Multiconstraint Zero-One Knapsack Problems With Genetic Algorithms , 1994 .
[51] Fred Glover,et al. Surrogate Constraint Duality in Mathematical Programming , 1975, Oper. Res..