Results 51 to 60 of about 2,383 (189)
On Labeled Traveling Salesman Problems [PDF]
, 2008 We consider labeled Traveling Salesman Problems, defined upon a complete graph of n vertices with colored edges. The objective is to find a tour of maximum (or minimum) number of colors. We derive results regarding hardness of approximation, and analyze approximation algorithms for both versions of the problem.
Basile Couëtoux +3 more
openaire +1 more source
Understanding Digital Financial Literacy Among Older Adults in Sweden
Accounting &Finance, EarlyView.ABSTRACT This study examined digital financial literacy (DFL) among older adults in Sweden, with the aim of refining its conceptualisation for highly digitised welfare states. Sixteen semi‐structured interviews with individuals aged 65–93 across two municipalities were analysed inductively. While online banking and Swish were nearly universal, adoption
Fredrik Lundell, A. F. M. Jalal Ahamed
wiley +1 more source
Random gravitational emulation search algorithm (RGES (in scheduling traveling salesman problem
International Journal of Industrial Engineering and Production Research, 2018 this article proposes a new algorithm for finding a good approximate set of non-dominated solutions for solving generalized traveling salesman problem.
Ahmad Sheibat Alhamdi +1 more
doaj +2 more sources
The Traveling Salesman Problem with flexible coloring [PDF]
Discrete Applied Mathematics, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Roemer, T. A., Ahmadi, R., Dasu, S.
openaire +3 more sources
A Theoretical Approach for Structuring and Analysing Knowledge Provenance for Visual Analytics
Computer Graphics Forum, EarlyView.VAKG unfolds the interactions within the current knowledge model (A) into a temporal knowledge graph (B), which is structured as a 4‐way graph containing two temporal (green) and two static (yellow) knowledge graphs. By using VAKG, one can structure and store the user's knowledge‐gathering process and all related interactions for eventual analysis (C).
L. Christino +3 more
wiley +1 more source
The geometric maximum traveling salesman problem [PDF]
Journal of the ACM, 2003 We consider the traveling salesman problem when the cities are points in ℝ d for some fixed d and distances are computed according to geometric distances, determined by some norm.
Alexander I. Barvinok +5 more
openaire +4 more sources
Scalable Computation of Topological Abstractions for Scalar Data
Computer Graphics Forum, EarlyView.Abstract Topological data analysis has become an important tool for large scale scalar data analysis and visualization, efficiently extracting the inherent structure and features of interest of the data. However, with growing dataset sizes and complexity, it is increasingly becoming infeasible to compute topological abstractions of interest in serial ...
M. Will +6 more
wiley +1 more source
A matheuristic for the traveling salesman problem with positional consistency constraints
International Transactions in Operational Research, EarlyView.Abstract We propose a matheuristic for the traveling salesman problem with positional consistency constraints, where we seek to generate a set of routes with minimum total cost, in which the nodes visited in more than one route (consistent nodes) must occupy the same relative position in all routes.
Luís Gouveia, Ana Paias, Mafalda Ponte
wiley +1 more source
Improved Cross Entropy Algorithm for the Optimum of Charge Planning Problem
Abstract and Applied Analysis, 2014 To solve the charge planning problem involving charges and the orders in each charge, a traveling salesman problem based charge planning model and the improved cross entropy algorithm are proposed. Firstly, the charge planning problem with unknown charge
Fan Yang, Qiqiang Li
doaj +1 more source
The Pyramidal Method for Traveling Salesman Problem
Communications, 2000 A shortest pyramidal tour (SPT) is a well-solved case of TSP when a distance matrix is the Monge matrix. We study heuristic repeating method for SPT with the distance matrix without restriction.
Stefan Pesko
doaj +1 more source