An aggregation heuristic for large scale p-median problem
Year of publication: |
2012
|
---|---|
Authors: | Avella, Pasquale ; Boccia, Maurizio ; Salerno, Saverio ; Vasilyev, Igor |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 39.2012, 7, p. 1625-1632
|
Subject: | Heuristik | Heuristics | Theorie | Theory | Aggregation | Mathematische Optimierung | Mathematical programming |
-
Duque, Juan C., (2012)
-
Efficient algorithms using subiterative convergence for Kemeny ranking problem
Badal, Prakash S., (2018)
-
The linear ordering problem with clusters : a new partial ranking
Alcaraz, Javier, (2020)
- More ...
-
A computational study of exact knapsack separation for the generalized assignment problem
Avella, Pasquale, (2010)
-
Computational experience with general cutting planes for the Set Covering problem
Avella, Pasquale, (2009)
-
Computational experience with general cutting planes for the Set Covering problem
Avella, Pasquale, (2009)
- More ...