Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Journal Article
%1 journals/dam/TheveninZ19
%A Thevenin, Simon
%A Zufferey, Nicolas
%D 2019
%J Discret. Appl. Math.
%K dblp
%P 344-353
%T Learning Variable Neighborhood Search for a scheduling problem with time windows and rejections.
%U http://dblp.uni-trier.de/db/journals/dam/dam261.html#TheveninZ19
%V 261
@article{journals/dam/TheveninZ19,
added-at = {2020-02-20T00:00:00.000+0100},
author = {Thevenin, Simon and Zufferey, Nicolas},
biburl = {https://www.bibsonomy.org/bibtex/2a55867045b3790ff06723166e3705bef/dblp},
ee = {https://doi.org/10.1016/j.dam.2018.03.019},
interhash = {9594201b03c9c79bdf84eafc62a78700},
intrahash = {a55867045b3790ff06723166e3705bef},
journal = {Discret. Appl. Math.},
keywords = {dblp},
pages = {344-353},
timestamp = {2020-02-21T12:40:59.000+0100},
title = {Learning Variable Neighborhood Search for a scheduling problem with time windows and rejections.},
url = {http://dblp.uni-trier.de/db/journals/dam/dam261.html#TheveninZ19},
volume = 261,
year = 2019
}