%0 Journal Article %1 journals/ior/Garfinkel73 %A Garfinkel, Robert S. %D 1973 %J Operations Research %K dblp %N 1 %P 340-343 %T Technical Note - On Partitioning the Feasible Set in a Branch-and-Bound Algorithm for the Asymmetric Traveling-Salesman Problem. %U http://dblp.uni-trier.de/db/journals/ior/ior21.html#Garfinkel73 %V 21

@article{journals/ior/Garfinkel73, added-at = {2016-05-26T00:00:00.000+0200}, author = {Garfinkel, Robert S.}, biburl = {https://www.bibsonomy.org/bibtex/27b34726fcc00facc4fc10a7f15a7b54b/dblp}, ee = {http://dx.doi.org/10.1287/opre.21.1.340}, interhash = {2f0d63cab4f297e7cc5e616550837b48}, intrahash = {7b34726fcc00facc4fc10a7f15a7b54b}, journal = {Operations Research}, keywords = {dblp}, number = 1, pages = {340-343}, timestamp = {2016-05-27T11:35:11.000+0200}, title = {Technical Note - On Partitioning the Feasible Set in a Branch-and-Bound Algorithm for the Asymmetric Traveling-Salesman Problem.}, url = {http://dblp.uni-trier.de/db/journals/ior/ior21.html#Garfinkel73}, volume = 21, year = 1973 }