New path elimination constraints for multi-depot routing problems

Author:

Bektaş Tolga1,Gouveia Luís2,Santos Daniel2

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

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

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3