Combining and projecting flow models for the (precedence constrained) asymmetric traveling salesman problem-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Combining and projecting flow models for the (precedence constrained) asymmetric traveling salesman problem

Published:2017-08-23 Issue:4 Volume:71 Page:451-465
ISSN:0028-3045
Container-title:Networks
language:en
Short-container-title:NETWORKS

Author:

Gouveia Luis¹,Pesneau Pierre²,Ruthmair Mario³,Santos Daniel¹

Affiliation:

1. Faculty of Sciences, Department of Statistics and OR, CMAF-CIO; University of Lisbon; Lisbon Portugal

2. University of Bordeaux, UMR 5251, INRIA Bordeaux - Sud-Ouest; Talence France

3. Department of Statistics and Operations Research; University of Vienna; Vienna Austria

Funder

Portuguese National Funding from Fundação para a Ciência e a Tecnologia

Vienna Science and Technology Fund (WWTF)

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.21765/fullpdf

Reference19 articles.

1. The precedence-constrained asymmetric traveling salesman polytope;Balas;Math Program,1995

2. M. Barbato R. Grappe M. Lacroix R. Wolfler Calvo A set covering approach for the double traveling salesman problem with multiple stacks R. Cerulli S. Fujishige A. R. Mahjoub Springer Berlin 2016 260 272

3. Multivalued decision diagrams for sequencing problems;Cire;Oper Res,2013

4. A new formulation for the travelling salesman problem;Claus;SIAM J Algebraic Discrete Methods,1984

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

1. Quasi-linear time heuristic to solve the Euclidean traveling salesman problem with low gap;Journal of Computational Science;2024-10

2. A Branch-and-Cut algorithm for the multiple Steiner TSP with order constraints;Annals of Operations Research;2024-05-06

3. Formulations for the clustered traveling salesman problem with d-relaxed priority rule;Computers & Operations Research;2024-01

4. Branching Algorithms for the Reliable Production Process Design Problem;Lecture Notes in Computer Science;2024

5. Precedence constrained generalized traveling salesman problem: Polyhedral study, formulations, and branch-and-cut algorithm;European Journal of Operational Research;2023-09

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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