@techreport{TR-IC-PFG-18-40,
   number = {IC-PFG-18-40},
   author = {Pedro Ciambra and Fábio Usberti},
   title  = {{An implementation of the Greedy Heuristic algorithms for
                   the Maximal Blood Collection Problem}},
   month = {December},
   year = {2018},
   institution = {Institute of Computing, University of Campinas},
   note = {In English, 9 pages.
    \par\selectlanguage{english}\textbf{Resumo}
       We  provide  implementations of the Greedy Heuristic and Greedy
       Recursive Heuristic proposed by Özener and Ekici (2018) for the
       Maximal   Blood   Collection  Problem.  In  this  problem,  the 
       objective is to to route blood donations from donation sites to
       a  processing  facility  within a time limit for each donation.
       \par  Our  implementations  perform  much more quickly than the
       speeds reported by the original work. We attribute this speedup
       to  the  use of pure C++ and simple optimization techniques, as
       opposed   to  the  use  of  an  overhead-heavy  framework.  The 
       measurement of the quality of the algorithm also differs, which
       we  attribute  to an under-specification of both the algorithms
       and the measurement technique.
  }
}