New path elimination constraints for multi-depot routing problems-Reference-Cited by-同舟云学术

New path elimination constraints for multi-depot routing problems

Published:2017-08-09 Issue:3 Volume:70 Page:246-261
ISSN:0028-3045
Container-title:Networks
language:en
Short-container-title:NETWORKS

Author:

Bektaş Tolga¹,Gouveia Luís²,Santos Daniel²

Affiliation:

1. Centre for Operational Research, Management Science and Information Systems (CORMSIS), Southampton Business School, University of Southampton; Highfield Southampton SO17 1BJ United Kingdom

2. Centro de Matemática, Aplicações Fundamentais e Investigação Operacional (CMAF-CIO), DEIO, Faculdade de Ciências, Universidade de Lisboa; C6 - Piso 4 Lisbon 1749-016 Portugal

Funder

Fundação para a Ciência e a Tecnologia, under projects

Programa de Bolsas de Doutoramento da Universidade de Lisboa

Publisher

Wiley

Subject

Computer Networks and Communications,Hardware and Architecture,Information Systems,Software

Link

http://onlinelibrary.wiley.com/wol1/doi/10.1002/net.21760/fullpdf

Reference15 articles.

1. A comparative analysis of several asymmetric traveling salesman problem formulations;Öncan;Comput Oper Res,2009

2. M. T. Godinho L. Gouveia P. Pesneau On a time-dependent formulation and an updated classification of ATSP formulations Progress in combinatorial optimization A. R. Mahjoub ISTE-Wiley London 223 254

3. Models and algorithms for the asymmetric traveling salesman problem: An experimental comparison;Roberti;EURO J Transp Logist,2012

4. Hamiltonian location problems;Laporte;Eur J Oper Res,1983

5. An exact algorithm for solving a capacitated location-routing problem;Laporte;Ann Oper Res,1986

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

1. The Hamiltonian p-median problem: Polyhedral results and branch-and-cut algorithms;European Journal of Operational Research;2024-07

2. Cooperative Driving Route Planning Based on Asymmetric Multi-Agent Path Planning Problem with Limited Service Area Constraints;2024

3. Node based compact formulations for the Hamiltonian p‐median problem;Networks;2023-06-09

4. Multi-Depot Routing with Split Deliveries: Models and a Branch-and-Cut Algorithm;Transportation Science;2023-03

5. The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods;Networks;2022-09-07