## Abstract This article investigates the application of very large neighborhood search techniques for solving the capacitated vertex __p__βcenter problem. We characterize a local search neighborhood in terms of path and cyclic exchanges of customers among facilities, and exploit principles borrowe
β¦ LIBER β¦
Morph-Based Local-Search Heuristics for Large-Scale Combinatorial Data Analysis
β Scribed by Brusco, Michael J.
- Book ID
- 113036068
- Publisher
- Springer
- Year
- 1999
- Tongue
- English
- Weight
- 964 KB
- Volume
- 16
- Category
- Article
- ISSN
- 0176-4268
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Large-scale local search heuristics for
β
Maria Paola Scaparra; Stefano Pallottino; Maria Grazia ScutellΓ
π
Article
π
2004
π
John Wiley and Sons
π
English
β 296 KB
[Lecture Notes in Computer Science] Engi
β
StΓΌtzle, Thomas; Birattari, Mauro; Hoos, Holger H.
π
Article
π
2009
π
Springer Berlin Heidelberg
β 112 KB
Iterated local search algorithm based on
β
Lixin Tang; Xianpeng Wang
π
Article
π
2005
π
Springer
π
English
β 603 KB
[Lecture Notes in Computer Science] Lang
β
KΕopotek, MieczysΕaw A.; Koronacki, Jacek; Marciniak, MaΕgorzata; Mykowiecka, Ag
π
Article
π
2013
π
Springer Berlin Heidelberg
π
English
β 539 KB
This book constitutes the refereed proceedings of the International Conference on Intelligent Information Systems, IIS 2013, held in Warsaw, Poland in June 2013. The 28 full papers included in this volume were carefully reviewed and selected from 53 submissions. The contributions are organized in to
96/06190 Data envelopment analysis of sp
π
Article
π
1996
π
Elsevier Science
β 189 KB
[IEEE Instruments (ICEMI) - Chengdu, Chi
β
Wu Heran, ; Lv Jian, ; Zhou Yun, ; Zhang Ning, ; Jiang Yadong,
π
Article
π
2011
π
IEEE
β 149 KB