Variable Neighborhood Search for a Prize Collecting Capacity Constrained Connected Facility Location Problem
暂无分享,去创建一个
[1] Chak-Kuen Wong,et al. A faster approximation algorithm for the Steiner problem in graphs , 1986, Acta Informatica.
[2] Maria Minkoff. The Prize Collecting Steiner Tree Problem , 2000 .
[3] Ivana Ljubic,et al. A Hybrid VNS for Connected Facility Location , 2007, Hybrid Metaheuristics.
[4] Kyung-Yong Chwa,et al. Approximation algorithms for connected facility location problems , 2008, J. Comb. Optim..
[5] Silvano Martello,et al. Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization , 2012 .
[6] Chaitanya Swamy,et al. Primal–Dual Algorithms for Connected Facility Location Problems , 2004, Algorithmica.
[7] David R. Karger,et al. Building Steiner trees with incomplete global knowledge , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[8] Deeparnab Chakrabarty,et al. Knapsack Problems , 2008 .
[9] Nenad Mladenović,et al. An Introduction to Variable Neighborhood Search , 1997 .
[10] Milind Dawande,et al. Approximation Algorithms for the Multiple Knapsack Problem with Assignment Restrictions , 2000, J. Comb. Optim..