Cite
The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm.
MLA
Dumitrescu, Irina, et al. “The Traveling Salesman Problem with Pickup and Delivery: Polyhedral Results and a Branch-and-Cut Algorithm.” Mathematical Programming, vol. 121, no. 2, Feb. 2010, pp. 269–305. EBSCOhost, https://doi.org/10.1007/s10107-008-0234-9.
APA
Dumitrescu, I., Ropke, S., Cordeau, J.-F., & Laporte, G. (2010). The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm. Mathematical Programming, 121(2), 269–305. https://doi.org/10.1007/s10107-008-0234-9
Chicago
Dumitrescu, Irina, Stefan Ropke, Jean-François Cordeau, and Gilbert Laporte. 2010. “The Traveling Salesman Problem with Pickup and Delivery: Polyhedral Results and a Branch-and-Cut Algorithm.” Mathematical Programming 121 (2): 269–305. doi:10.1007/s10107-008-0234-9.