@article{journals/ior/DumasDGS95,
  added-at = {2016-04-07T00:00:00.000+0200},
  author = {Dumas, Yvan and Desrosiers, Jacques and Gélinas, Éric and Solomon, Marius M.},
  biburl = {https://www.bibsonomy.org/bibtex/2e7bfd63ba165064ea63ff1d41826b6d8/dblp},
  ee = {http://dx.doi.org/10.1287/opre.43.2.367},
  interhash = {f0b0f460321458035ccc223dff817eef},
  intrahash = {e7bfd63ba165064ea63ff1d41826b6d8},
  journal = {Operations Research},
  keywords = {dblp},
  number = 2,
  pages = {367-371},
  timestamp = {2016-04-08T11:38:18.000+0200},
  title = {An Optimal Algorithm for the Traveling Salesman Problem with Time Windows.},
  url = {http://dblp.uni-trier.de/db/journals/ior/ior43.html#DumasDGS95},
  volume = 43,
  year = 1995
}

{"_id":"hC83dda4QtwG5RXex","bibbaseid":"dumas-desrosiers-glinas-solomon-anoptimalalgorithmforthetravelingsalesmanproblemwithtimewindows-1995","author_short":["Dumas, Y.","Desrosiers, J.","Gélinas, É.","Solomon, M. M."],"bibdata":{"bibtype":"article","type":"article","added-at":"2016-04-07T00:00:00.000+0200","author":[{"propositions":[],"lastnames":["Dumas"],"firstnames":["Yvan"],"suffixes":[]},{"propositions":[],"lastnames":["Desrosiers"],"firstnames":["Jacques"],"suffixes":[]},{"propositions":[],"lastnames":["Gélinas"],"firstnames":["Éric"],"suffixes":[]},{"propositions":[],"lastnames":["Solomon"],"firstnames":["Marius","M."],"suffixes":[]}],"biburl":"https://www.bibsonomy.org/bibtex/2e7bfd63ba165064ea63ff1d41826b6d8/dblp","ee":"http://dx.doi.org/10.1287/opre.43.2.367","interhash":"f0b0f460321458035ccc223dff817eef","intrahash":"e7bfd63ba165064ea63ff1d41826b6d8","journal":"Operations Research","keywords":"dblp","number":"2","pages":"367-371","timestamp":"2016-04-08T11:38:18.000+0200","title":"An Optimal Algorithm for the Traveling Salesman Problem with Time Windows.","url":"http://dblp.uni-trier.de/db/journals/ior/ior43.html#DumasDGS95","volume":"43","year":"1995","bibtex":"@article{journals/ior/DumasDGS95,\n added-at = {2016-04-07T00:00:00.000+0200},\n author = {Dumas, Yvan and Desrosiers, Jacques and Gélinas, Éric and Solomon, Marius M.},\n biburl = {https://www.bibsonomy.org/bibtex/2e7bfd63ba165064ea63ff1d41826b6d8/dblp},\n ee = {http://dx.doi.org/10.1287/opre.43.2.367},\n interhash = {f0b0f460321458035ccc223dff817eef},\n intrahash = {e7bfd63ba165064ea63ff1d41826b6d8},\n journal = {Operations Research},\n keywords = {dblp},\n number = 2,\n pages = {367-371},\n timestamp = {2016-04-08T11:38:18.000+0200},\n title = {An Optimal Algorithm for the Traveling Salesman Problem with Time Windows.},\n url = {http://dblp.uni-trier.de/db/journals/ior/ior43.html#DumasDGS95},\n volume = 43,\n year = 1995\n}\n\n","author_short":["Dumas, Y.","Desrosiers, J.","Gélinas, É.","Solomon, M. M."],"key":"journals/ior/DumasDGS95","id":"journals/ior/DumasDGS95","bibbaseid":"dumas-desrosiers-glinas-solomon-anoptimalalgorithmforthetravelingsalesmanproblemwithtimewindows-1995","role":"author","urls":{"Link":"http://dx.doi.org/10.1287/opre.43.2.367","Paper":"http://dblp.uni-trier.de/db/journals/ior/ior43.html#DumasDGS95"},"keyword":["dblp"],"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"http://www.bibsonomy.org/bib/author/Dumas?items=1000","dataSources":["gzytHe9CAy6apLxQh"],"keywords":["dblp"],"search_terms":["optimal","algorithm","traveling","salesman","problem","time","windows","dumas","desrosiers","gélinas","solomon"],"title":"An Optimal Algorithm for the Traveling Salesman Problem with Time Windows.","year":1995}