Results 71 to 80 of about 4,258 (228)
International Transactions in Operational Research, EarlyView.Abstract We address the scheduling conflicting jobs on parallel identical machines problem with makespan minimization, a classical and computationally challenging variant of parallel machine scheduling. We develop and evaluate three distinct solution methodologies: a novel constraint programming (CP) formulation, and two metaheuristics: a multi ...
Roberto Maria Rosati +3 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 Metric Travelling Salesman Problem: The Experiment on Pareto-optimal Algorithms
Труды Института системного программирования РАН, 2018 The Metric Travelling Salesman Problem is a subcase of the Travelling Salesman Problem (TSP), where the triangle inequality holds. It is a key problem in combinatorial optimization.
S. M. Avdoshin, E. N. Beresneva
doaj +1 more source
Traveling Salesman Problems in Temporal Graphs [PDF]
Theoretical Computer Science, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Othon Michail, Paul G. Spirakis
openaire +2 more sources
Discrete Starfish Optimization Algorithm for Symmetric Travelling Salesman Problem
IEEE AccessThis paper introduces a new discrete StarFish Optimization Algorithm (D-SFOA) to solve a complex discrete Symmetric Travelling Salesman Problem (STSP).
Muhammet Aktas, Fatih Kilic
doaj +1 more source
Can the Agent with Limited Information Solve Travelling Salesman Problem?
Complexity, 2017 Here, we develop new heuristic algorithm for solving TSP (Travelling Salesman Problem). In our proposed algorithm, the agent cannot estimate tour lengths but detect only a few neighbor sites. Under the circumstances, the agent occasionally ignores the NN
Tomoko Sakiyama, Ikuo Arizono
doaj +1 more source
International Transactions in Operational Research, Volume 33, Issue 6, Page 3714-3743, November 2026.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
The travelling salesman problem [PDF]
, 2012 In the travelling salesman problem we are given a graph. The task of the salesman is to find the shortest (or cheapest) possible route by visiting each vertex (that represents cities) exactly once and returning to the initial vertex (city).
Zupanc, Kaja
core
Ensuring connectedness for the maximum quasi‐clique and densest k‐subgraph problems
International Transactions in Operational Research, Volume 33, Issue 6, Page 3800-3824, November 2026.Abstract Given an undirected graph G$G$, a quasi‐clique is a subgraph of G$G$ with density at least γ$\gamma$ (0<γ≤1)$(0 < \gamma \le 1)$. Two optimisation problems can be defined for quasi‐cliques: the maximum quasi‐clique (MQC) problem, which finds a quasi‐clique with maximum vertex cardinality, and the densest k$k$‐subgraph (DKS) problem, which ...
Daniela Scherer dos Santos +3 more
wiley +1 more source
Three-dimensional Euclidian Distance to Neutrosophic Number for Travelling Salesman Problem [PDF]
Neutrosophic Sets and SystemsThe main idea in this paper is to study the application of the novel greedy Dhouib Matrix-TSP1 (DM-TSP1) method to solve the Travel Salesman Problem with simple neutrosophic numbers. Here, the Euclidian distance is used to convert the neutrosophic number
Souhail Dhouib +5 more
doaj +1 more source