Alternating control tree search for knapsack/covering problems
暂无分享,去创建一个
[1] Samuel P. Marin,et al. Balancing and optimizing a portfolio of R&D projects , 2001 .
[2] Martin W. P. Savelsbergh,et al. Preprocessing and Probing Techniques for Mixed Integer Programming Problems , 1994, INFORMS J. Comput..
[3] Wei Shih,et al. A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem , 1979 .
[4] Günther R. Raidl,et al. Combining Metaheuristics and Exact Algorithms in Combinatorial Optimization: A Survey and Classification , 2005, IWINAC.
[5] Paola Cappanera,et al. A Local-Search-Based Heuristic for the Demand-Constrained Multidimensional Knapsack Problem , 2001, INFORMS J. Comput..
[6] Lars Magnus Hvattum,et al. Adaptive memory search for multidemand multidimensional knapsack problems , 2006, Comput. Oper. Res..
[7] Claude Le Pape,et al. Exploring relaxation induced neighborhoods to improve MIP solutions , 2005, Math. Program..
[8] Rafael Martí,et al. Scatter Search: Diseño Básico y Estrategias avanzadas , 2002, Inteligencia Artif..
[9] Francesco Maffioli,et al. Discrete facility location and routing of obnoxious activities , 2003, Discret. Appl. Math..
[10] Jin-Kao Hao,et al. A hybrid approach for the 0-1 multidimensional knapsack problem , 2001, IJCAI 2001.
[11] A. L. Soyster,et al. Zero-one programming with many variables and few constraints , 1978 .
[12] F. Glover. HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS , 1977 .
[13] Hasan Pirkul,et al. ALLOCATION OF DATA BASES AND PROCESSORS IN A DISTRIBUTED COMPUTING SYSTEM. , 1982 .
[14] Frank Plastria,et al. Static competitive facility location: An overview of optimisation approaches , 2001, Eur. J. Oper. Res..
[15] Di Yuan,et al. A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem , 2000, Oper. Res..
[16] Meinolf Sellmann,et al. Lagrangian Cardinality Cuts and Variable Fixing for Capacitated Network Design , 2002, ESA.
[17] L. J. Savage,et al. Three Problems in Rationing Capital , 1955 .
[18] Willem Jan van Hoeve,et al. The Power of Semidefinite Programming Relaxations for MAX-SAT , 2006, CPAIOR.
[19] Matteo Fischetti,et al. Local branching , 2003, Math. Program..
[20] Eduardo Conde,et al. Semi-obnoxious location models: A global optimization approach , 1997 .
[21] Tobias Achterberg,et al. Conflict analysis in mixed integer programming , 2007, Discret. Optim..
[22] A. S. Manne,et al. On the Solution of Discrete Programming Problems , 1956 .
[23] Michel Gendreau,et al. Metaheuristics: Progress in Complex Systems Optimization , 2007 .
[24] Lars Magnus Hvattum,et al. Experiments Using Scatter Search for the Multidemand Multidimensional Knapsack Problem , 2007, Metaheuristics.
[25] Ralph E. Gomory,et al. The Theory and Computation of Knapsack Functions , 1966, Oper. Res..
[26] Michel Vasquez,et al. Improved results on the 0-1 multidimensional knapsack problem , 2005, Eur. J. Oper. Res..
[27] Meinolf Sellmann,et al. Streamlined Constraint Reasoning , 2004, CP.
[28] John E. Beasley,et al. A Genetic Algorithm for the Multidimensional Knapsack Problem , 1998, J. Heuristics.