@article{kulkarni85integer,
  title = {Integer Programming Formulations of Vehicle Routing Problems},
  author = {Kulkarni, R. V. and Bhave, P. R.},
  year = {1985},
  month = apr,
  journal = {European Journal of Operational Research},
  volume = {20},
  number = {1},
  pages = {58--67},
  issn = {0377-2217},
  doi = {10.1016/0377-2217(85)90284-X},
  abstract = {Various mathematical formulations are available for situations represented by vehicle routing problems. The assignment-based integer programming formulations of these problems are more common and easy to understand. Such formulations are discussed in this paper and a much simpler formulation for the vechicle routing problem is presented for the case, when all the vehicles have the same load capacity and maximum allowable cost per route.},
  langid = {english},
  annotation = {ZSCC: 0000250},
  file = {/Users/acosta/Zotero/storage/5AT3KBTD/Kulkarni and Bhave - 1985 - Integer programming formulations of vehicle routin.pdf;/Users/acosta/Zotero/storage/ADW6XXJH/037722178590284X.html}
}

{"_id":"7fyRTwF6gqsF5krFo","bibbaseid":"kulkarni-bhave-integerprogrammingformulationsofvehicleroutingproblems-1985","author_short":["Kulkarni, R. V.","Bhave, P. R."],"bibdata":{"bibtype":"article","type":"article","title":"Integer Programming Formulations of Vehicle Routing Problems","author":[{"propositions":[],"lastnames":["Kulkarni"],"firstnames":["R.","V."],"suffixes":[]},{"propositions":[],"lastnames":["Bhave"],"firstnames":["P.","R."],"suffixes":[]}],"year":"1985","month":"April","journal":"European Journal of Operational Research","volume":"20","number":"1","pages":"58–67","issn":"0377-2217","doi":"10.1016/0377-2217(85)90284-X","abstract":"Various mathematical formulations are available for situations represented by vehicle routing problems. The assignment-based integer programming formulations of these problems are more common and easy to understand. Such formulations are discussed in this paper and a much simpler formulation for the vechicle routing problem is presented for the case, when all the vehicles have the same load capacity and maximum allowable cost per route.","langid":"english","annotation":"ZSCC: 0000250","file":"/Users/acosta/Zotero/storage/5AT3KBTD/Kulkarni and Bhave - 1985 - Integer programming formulations of vehicle routin.pdf;/Users/acosta/Zotero/storage/ADW6XXJH/037722178590284X.html","bibtex":"@article{kulkarni85integer,\n title = {Integer Programming Formulations of Vehicle Routing Problems},\n author = {Kulkarni, R. V. and Bhave, P. R.},\n year = {1985},\n month = apr,\n journal = {European Journal of Operational Research},\n volume = {20},\n number = {1},\n pages = {58--67},\n issn = {0377-2217},\n doi = {10.1016/0377-2217(85)90284-X},\n abstract = {Various mathematical formulations are available for situations represented by vehicle routing problems. The assignment-based integer programming formulations of these problems are more common and easy to understand. Such formulations are discussed in this paper and a much simpler formulation for the vechicle routing problem is presented for the case, when all the vehicles have the same load capacity and maximum allowable cost per route.},\n langid = {english},\n annotation = {ZSCC: 0000250},\n file = {/Users/acosta/Zotero/storage/5AT3KBTD/Kulkarni and Bhave - 1985 - Integer programming formulations of vehicle routin.pdf;/Users/acosta/Zotero/storage/ADW6XXJH/037722178590284X.html}\n}\n\n","author_short":["Kulkarni, R. V.","Bhave, P. R."],"key":"kulkarni85integer","id":"kulkarni85integer","bibbaseid":"kulkarni-bhave-integerprogrammingformulationsofvehicleroutingproblems-1985","role":"author","urls":{},"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"https://www.dropbox.com/s/6qxz2tlaz2bi6av/costaam.bib?dl=1","dataSources":["C8ZTSgdcqKrDKQsFr"],"keywords":[],"search_terms":["integer","programming","formulations","vehicle","routing","problems","kulkarni","bhave"],"title":"Integer Programming Formulations of Vehicle Routing Problems","year":1985}