Variable neighborhood search for maximum diverse grouping problem
This paper presents a general variable neighborhood search (GVNS) heuristic for solving the maximum diverse grouping problem. Extensive computational experiments performed on a series of large random graphs as well as on several instances of the maximum diversity problem taken from the lite...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Belgrade
2014-01-01
|
| Series: | Yugoslav Journal of Operations Research |
| Subjects: | |
| Online Access: | http://www.doiserbia.nb.rs/img/doi/0354-0243/2014/0354-02431300003U.pdf |