Results 81 to 90 of about 166,209 (267)
International Transactions in Operational Research, EarlyView.Abstract This paper investigates an extension of the vehicle routing problem in which, in addition to minimizing the distance traveled, the sequencing of customer visits is subject to precedence constraints that impose visiting priorities among customers.
Eduardo dos Santos Teixeira +1 more
wiley +1 more source
Journal of Management Studies, EarlyView.Abstract We analyse the behaviour of multinational enterprises (MNEs) within a host nation – Australia – during deglobalization (1914–79). Deglobalization is often portrayed as a drastic event to which MNEs respond swiftly, probably through withdrawal from host countries.
Pierre Van der Eng +4 more
wiley +1 more source
The Maximum Traveling Salesman Problem with Submodular Rewards [PDF]
, 2012 In this paper, we look at the problem of finding the tour of maximum reward on an undirected graph where the reward is a submodular function, that has a curvature of $\kappa$, of the edges in the tour. This problem is known to be NP-hard.
Jawaid Stephen, L. Smith, Syed Talha
core
Simulated Annealing Algorithm for Determining Travelling Salesman Problem Solution and Its Comparison with Branch and Bound Method [PDF]
, 2022 Bib Paruhum Silalahi +3 more
openalex +1 more source
An empirical investigation into randomly generated Euclidean symmetric traveling salesman problems [PDF]
The traveling salesman problem is one of the most well-solved hard combinatorial optimization problems. Any new algorithm or heuristic for the traveling salesman problem is empirically evaluated based on its performance on standard test instances, as ...
Ghosh, Diptesh, Sharma, Megha
core
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
The team orienteering problem with variable time windows
International Transactions in Operational Research, Volume 33, Issue 3, Page 1705-1732, May 2026.Abstract The orienteering problem is well‐established within the domain of operational research. This paper introduces the team orienteering problem with variable time windows (TOPVTW) as a new variant of the team orienteering problem with time windows. The distinguishing feature of the TOPVTW is the adaptive time windows, which evolve dynamically as a
Bibiana Granda, Begoña Vitoriano
wiley +1 more source
GCN-Pointransformer Model for Solving Traveling Salesman Problem [PDF]
Jisuanji kexue yu tansuoBecause the Transformer model is based on the fully connected attention mechanism, the computational complexity is high and the GPU memory usage is too large when solving the classic traveling salesman problem (TSP).
QIU Yunfei, LIU Yifei, YU Zhilong, JIN Haibo
doaj +1 more source
International Transactions in Operational Research, Volume 33, Issue 2, Page 719-774, March 2026.Abstract The transformative potential of artificial intelligence (AI) ChatBots, leveraging natural language processing for information retrieval and knowledge synthesis, has garnered attention across diverse fields, including research. Recognizing AI's importance, researchers and policymakers are actively engaged in its development.
Cinzia Daraio +2 more
wiley +1 more source
Advanced Functional Materials, Volume 36, Issue 1, 2 January 2026.Advances in integrating artificial intelligence into 3D bioprinting are systematically reviewed here. Machine learning, computer vision, robotics, natural language processing, and expert systems are examined for their roles in optimizing bioprinting parameters, real‐time monitoring, quality control, and predictive maintenance.
Joao Vitor Silva Robazzi +10 more
wiley +1 more source