Matheuristics for the capacitated p-median problem
暂无分享,去创建一个
Olinto César Bassi de Araújo | Fernando Stefanello | Felipe Martins Müller | F. M. Müller | O. Araújo | F. Stefanello
[1] Thomas Stützle,et al. Combinations of Local Search and Exact Algorithms , 2003, EvoWorkshops.
[2] Juan A. Díaz,et al. Hybrid scatter search and path relinking for the capacitated p , 2006, Eur. J. Oper. Res..
[3] El-Ghazali Talbi,et al. A Taxonomy of Hybrid Metaheuristics , 2002, J. Heuristics.
[4] J. Mulvey,et al. Solving capacitated clustering problems , 1984 .
[5] Silvely Nogueira de Almeida Salomão,et al. A relaxação Lagrangeana/surrogate e o método de geração de colunas: novos limitantes e novas colunas , 2003 .
[6] Jürg Nievergelt,et al. Exhaustive Search, Combinatorial Optimization and Enumeration: Exploring the Potential of Raw Computing Power , 2000, SOFSEM.
[7] Roberto Baldacci,et al. A new method for solving capacitated location problems based on a set partitioning approach , 2002, Comput. Oper. Res..
[8] Tore Grünert,et al. A Hybrid Tabu Search/Branch-and-Bound Algorithm for the Direct Flight Network Design Problem , 2000, Transp. Sci..
[9] Rolf Wendolsky,et al. A scatter search heuristic for the capacitated clustering problem , 2006, Eur. J. Oper. Res..
[10] El-Ghazali Talbi,et al. Hybridizing exact methods and metaheuristics: A taxonomy , 2009, Eur. J. Oper. Res..
[11] Roberto Baldacci,et al. A Bionomic Approach to the Capacitated p-Median Problem , 1998, J. Heuristics.
[12] Juan M. Corchado,et al. Innovations in Hybrid Intelligent Systems , 2008, Advances in Soft Computing.
[13] Günther R. Raidl,et al. Combining Metaheuristics and Exact Algorithms in Combinatorial Optimization: A Survey and Classification , 2005, IWINAC.
[14] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[15] Helena Ramalhinho Dias Lourenço,et al. Optimised Search Heuristics: A Mapping of Procedures and Combinatorial Optimisation Problems , 2006 .
[16] Hasan Pirkul,et al. Efficient algorithms for the capacitated concentrator location problem , 1987, Comput. Oper. Res..
[17] Éric D. Taillard,et al. Popmusic — Partial Optimization Metaheuristic under Special Intensification Conditions , 2002 .
[18] Rubén Ruiz,et al. Size-reduction heuristics for the unrelated parallel machines scheduling problem , 2011, Comput. Oper. Res..
[19] Luiz Antonio Nogueira Lorena,et al. A column generation approach to capacitated p-median problems , 2004, Comput. Oper. Res..
[20] Nicos Christofides,et al. Capacitated clustering problems by hybrid simulated annealing and tabu search , 1994 .
[21] Krzysztof Fleszar,et al. An effective VNS for the capacitated p-median problem , 2008, Eur. J. Oper. Res..
[22] Luiz Antonio Nogueira Lorena,et al. Clustering Search Heuristic for the Capacitated p -Median Problem , 2008, Innovations in Hybrid Intelligent Systems.
[23] Claudio Sterle,et al. A Cut and Branch Approach for the Capacitated p-Median Problem Based on Fenchel Cutting Planes , 2008, J. Math. Model. Algorithms.
[24] Samad Ahmadi,et al. Greedy random adaptive memory programming search for the capacitated clustering problem , 2005, Eur. J. Oper. Res..