搜索页_Traveling+salesman

设为首页

收藏本站

网站地图 | English | 公务邮箱

About the library

Background
History
Leadership
Organization

Readers' Guide

Opening Hours
Collections
Help Via Email

Publications

Electronic Information Resources

常用资源

GSW全文库(1)	馆藏书目(1)	万方学术会议(1)	CNKI学位论文(3539)	知网期刊论文(2025)
中国地质文献-英文(1)	Springer电子图书(48)	CNKI会议论文(9)	CNKI期刊论文0611(4)	万方学位论文(2)

在“Elsevier电子期刊”中，命中：755条，耗时：小于0.01 秒

在所有数据库中总计命中：5,631条

1.Polynomially solvable cases of the bipartite traveling salesman problem

作者：Alfredo Garcí ; a ^{olaverri@unizar.es" class="auth_mail" title="E-mail the corresponding author} ; Javier Tejel ; ^{jtejel@unizar.es" class="auth_mail" title="E-mail the corresponding author}

关键词：Traveling salesman ; Combinatorial optimization ; Bipartite traveling salesman ; quadrangle property ; Kalmanson matrix

刊名：European Journal of Operational Research

出版年：2017

2.Perturbed Decomposition Algorithm applied to the multi-objective Traveling Salesman Problem

作者：Marek Cornu ; ^{marek.cornu@lamsade.dauphine.fr} ; Tristan Cazenave ; Daniel Vanderpooten

关键词：Multi-objective combinatorial optimization ; Multi-objective Traveling Salesman Problem ; Meta-heuristics ; Pareto Local search ; Decomposition algorithm ; Data perturbation

刊名：Computers & Operations Research

出版年：2017

3.New semidefinite programming relaxations for the Linear Ordering and the Traveling Salesman Problem

作者：Philipp Hungerlä ; nder ^{philipp.hungerlaender@aau.at}

关键词：Linear Ordering Problem ; Max cut problem ; Traveling Salesman Problem ; Target visitation problem ; Vertex ordering problems ; Semidefinite programming ; Approximation algorithms ; Global optimization

刊名：Discrete Applied Mathematics

出版年：2017

4.A novel discretization scheme for the close enough traveling salesman problem

作者：Francesco Carrabs^a ; ^{fcarrabs@unisa.it} ; Carmine Cerrone^c ; ^{carmine.cerrone@unimol.it} ; Raffaele Cerulli^a ; ^{raffaele@unisa.it} ; Manlio Gaudioso^b ; ^d ; ^{manlio.gaudioso@unical.it}

关键词：Close-enough ; Traveling salesman problem ; Discretization scheme

刊名：Computers & Operations Research

出版年：2017

5.A traveling salesman problem with pickups and deliveries, time windows and draft limits: Case study from chemical shipping

作者：Mari Jevne Arnesen^a ; Magnhild Gjestvang^a ; Xin Wang^a ; ^{xin.wang@iot.ntnu.no" class="auth_mail" title="E-mail the corresponding author} ; Kjetil Fagerholt^a ; Kristian Thun^a ; Jø ; rgen G. Rakke^b

关键词：Maritime transportation ; Traveling salesman problem with pickup and delivery ; Draft limit ; Dynamic programming

刊名：Computers and Operations Research

出版年：2017

6.The pickup and delivery traveling salesman problem with handling costs

作者：Marjolein Veenstra ; ^a ; ^{marjolein.veenstra@rug.nl" class="auth_mail" title="E-mail the corresponding author} ; Kees Jan Roodbergen^a ; ^{k.j.roodbergen@rug.nl" class="auth_mail" title="E-mail the corresponding author} ; Iris F.A. Vis^a ; ^{i.f.a.vis@rug.nl" class="auth_mail" title="E-mail the corresponding author} ; Leandro C. Coelho^a ; ^b ; ^{leandro.coelho@cirrelt.ca" class="auth_mail" title="E-mail the corresponding author}

关键词：Routing ; Pickup and delivery ; Packing ; Handling costs ; Metaheuristics

刊名：European Journal of Operational Research

出版年：2017

7.An extension of the Christofides heuristic for the generalized multiple depot multiple traveling salesmen problem

作者：Zhou Xu ; ^a ; ^{lgtzx@polyu.edu.hk" class="auth_mail" title="E-mail the corresponding author} ; Brian Rodrigues^b ; ^{brianr@smu.edu.sg" class="auth_mail" title="E-mail the corresponding author}

关键词：Approximation algorithm ; Multiple depots ; Traveling salesman problem

刊名：European Journal of Operational Research

出版年：2017

8.Cooperative group optimization with ants (CGO-AS): Leverage optimization with mixed individual and social learning

关键词：Ant systems ; Cooperative group optimization ; Traveling salesman problem ; Global optimization ; Group intelligence ; Population-based methods ; Socially biased individual learning

刊名：Applied Soft Computing

出版年：2017

9.Effective heuristics for ant colony optimization to handle large-scale problems

作者：Hassan Ismkhan ^{H.Ismkhan@bonabu.ac.ir} ^{Esmkhan@gmail.com}Author Vitae

关键词：Large-scale optimization ; Ant colony optimization ; ACO ; Heuristics ; Traveling salesman problem

刊名：Swarm and Evolutionary Computation

出版年：2017

10.Constant factor approximation algorithm for TSP satisfying a biased triangle inequality

作者：Usha Mohan^a ; ^{ushamohan@iitm.ac.in} ; Sivaramakrishnan Ramani^a ; ^{ms12s016@smail.iitm.ac.in} ; Sounaka Mishra^b ; ^{sounak@iitm.ac.in}

关键词：TSP ; Relaxed triangle inequality ; Approximation algorithms

刊名：Theoretical Computer Science

出版年：2017

按检索点细分(755)

题名(267)

关键词(445)

文摘(616)

按出版年细分(755)

2027年及以后(27)

2017年(13)

2016年(40)

2015年(6)

2014年(1)

2013年(36)

2012年(55)

2011年(51)

2010年(43)

2009年(52)

2008年(44)

2007年(32)

2006年(34)

2005年(20)

2004年(30)

2003年(26)

2002年(34)

2001年(19)

2000年(33)

2000年及以前(159)