%0 Journal Article %1 journals/networks/BenaventCDLPS14 %A Benavent, Enrique %A Corberán, Angel %A Desaulniers, Guy %A Lessard, François %A Plana, Isaac %A Sanchis, José M. %D 2014 %J Networks %K dblp %N 1 %P 34-45 %T A branch-price-and-cut algorithm for the min-max k-vehicle windy rural postman problem. %U http://dblp.uni-trier.de/db/journals/networks/networks63.html#BenaventCDLPS14 %V 63

@article{journals/networks/BenaventCDLPS14, added-at = {2022-01-03T00:00:00.000+0100}, author = {Benavent, Enrique and Corberán, Angel and Desaulniers, Guy and Lessard, François and Plana, Isaac and Sanchis, José M.}, biburl = {https://www.bibsonomy.org/bibtex/28d007dcce13e704a61beb25f5cba325d/dblp}, ee = {https://doi.org/10.1002/net.21520}, interhash = {d805881b9d16e9a7dc1c7006bb010330}, intrahash = {8d007dcce13e704a61beb25f5cba325d}, journal = {Networks}, keywords = {dblp}, number = 1, pages = {34-45}, timestamp = {2024-04-09T05:40:42.000+0200}, title = {A branch-price-and-cut algorithm for the min-max k-vehicle windy rural postman problem.}, url = {http://dblp.uni-trier.de/db/journals/networks/networks63.html#BenaventCDLPS14}, volume = 63, year = 2014 }