A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery-Reference-Cited by-同舟云学术

A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery

Published:2004-12 Issue:1 Volume:145 Page:126-139
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Hernández-Pérez Hipólito,Salazar-González Juan-José

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference16 articles.

1. R.K. Ahuja, T.L. Magnanti, J.B. Orlin, Network flows, in: G.L. Nemhauser, A.H.G. Rinnooy Kan, M.J. Todd (Eds.), Optimization, Vol. I, North-Holland, Amsterdam, 1989.

2. The swapping problem;Anily;Networks,1992

3. The traveling salesman problem with delivery and backhauls;Anily;Oper. Res. Lett,1994

4. D. Applegate, R. Bixby, V. Chvatal, W. Cook, Concorde: a code for solving traveling salesman problem, http://www.math.princeton.edu/tsp/concorde.html, 1999.

5. Set partitioning;Balas;SIAM Rev,1976

Cited by 145 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Data-driven analysis of optimal repositioning policy in bike sharing systems;INFOR: Information Systems and Operational Research;2024-06-26

2. Exploring Tourists’ Preferences for Bike-Sharing Services in the Context of Tourism;Sustainability;2024-04-17

3. The last-mile delivery vehicle routing problem with handling cost in the front warehouse mode;Computers & Industrial Engineering;2024-04

4. An exact algorithm for unpaired pickup and delivery vehicle routing problem with multiple commodities and multiple visits;Transportation Research Part C: Emerging Technologies;2024-03

5. Deep Reinforcement Learning for Solving Vehicle Routing Problems With Backhauls;IEEE Transactions on Neural Networks and Learning Systems;2024