/wcoem-ils

A C++ implementation of an Iterated Local Search for minimizing weighted carry-over values in single round-robin tournaments

wco-ils

An Iterated Local Search for minimizing weighted carry-over effects in single round robin tournaments

About

This implementation was published on A new neighborhood structure for round robin scheduling problems - Computers and Operations Research.

Please cite as follows: Tiago Januario, Sebastián Urrutia, A new neighborhood structure for round robin scheduling problems, Computers & Operations Research, Volume 70,Pages 127-139,2016.

Bibtex code:

@article{JANUARIO2016127,
  title   = {A new neighborhood structure for round robin scheduling problems},
  journal = {Computers \& Operations Research},
  volume  = {70},
  pages   = {127 - 139},
  year    = {2016},
  issn    = {0305-0548},
  doi     = {https://doi.org/10.1016/j.cor.2015.12.016},
  url     = {http://www.sciencedirect.com/science/article/pii/S0305054815003020},
  author  = {Tiago Januario and Sebastián Urrutia}
}