On a new edge function on complete weighted graphs and its application for locating Hamiltonian cycles of small weight
type: Item
instance of: scholarly article
title: On a new edge function on complete weighted graphs and its application for locating Hamiltonian cycles of small weight
zbMATH Open document ID: 1353.90171
author: Panayotis E. Nastou
author: Vassilis Papadinas
author: Panos M. Pardalos
author: Yannis C. Stamatiou
published in: Optimization Letters
publication date: 2016-09-21T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6628839
zbMATH Keywords: minimum weight Hamiltonian cycles
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: travelling salesman problem
zbMATH Keywords: heuristics
zbMATH Keywords: nearest neighbor heuristic
MaRDI profile type: Publication
full work available at URL: s11590-015-0914-3
OpenAlex ID: W832351726
cites work: Q4303939
cites work: Nonlinear assignment problems. Algorithms and applications
cites work: P-Complete Approximation Problems
cites work: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
cites work: Traveling salesman should not be greedy: Domination analysis of greedy-type heuristics for the TSP
cites work: Q4155835
cites work: The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms
cites work: Reducibility among Combinatorial Problems
cites work: Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
cites work: Q3677509
cites work: Q3579792
cites work: Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems
cites work: The Euclidean traveling salesman problem is NP-complete
cites work: Q4542574
DOI: 10.1007/S11590-015-0914-3
Recommended article: Hamiltonian problems in edge-colored complete graphs and eulerian cycles in edge-colored graphs : some complexity results
Recommended article: Q4817463
Recommended article: On edge-hamiltonian Cayley graphs
Recommended article: Q3385707
Recommended article: Q3715141
Recommended article: Q3137195
Recommended article: A NEW VERTEX-COLORING EDGE-WEIGHTING OF COMPLETE GRAPHS
Recommended article: Heavy cycles in Hamiltonian weighted graphs
Recommended article: On the extremal number of edges in Hamiltonian connected graphs
Recommended article: Q5432806
description: scientific article; zbMATH DE number 6628839