Results 71 to 80 of about 59,482 (207)

Fluctuations in the Site Disordered Traveling Salesman Problem

, 2007
We extend a previous statistical mechanical treatment of the traveling salesman problem by defining a discrete "site disordered'' problem in which fluctuations about saddle points can be computed.
Barvinok A, David Lancaster, David S Dean, Davis P J, De Bruijn N G, Dean D S, Garfinkel R S, Ghosh M, Johnson D S, Karp R M, Krauth W, McKay B D, Mézard M, Olver F W J, Wong R, Zee A   +15 more
core   +2 more sources

Exact and metaheuristic approaches to minimizing makespan in parallel machine scheduling with conflicting jobs

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, Dinh Quy Ta, Minh Hoàng Hà, Andrea Schaerf   +3 more
wiley   +1 more source

On the Nearest Neighbor Rule for the Metric Traveling Salesman Problem [PDF]

, 2014
We present a very simple family of traveling salesman instances with $n$ cities where the nearest neighbor rule may produce a tour that is $\Theta(\log n)$ times longer than an optimum solution.
Hougardy, Stefan, Wilde, Mirko
core  

Ensuring connectedness for the maximum quasi‐clique and densest k‐subgraph problems

International Transactions in Operational Research, EarlyView.
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, Kathrin Klamroth, Pedro Martins, Luís Paquete   +3 more
wiley   +1 more source

GCN-Pointransformer Model for Solving Traveling Salesman Problem [PDF]

Jisuanji kexue yu tansuo
Because 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

Keep on Keepin’ on Down Under: Administrative Heritage and the Strategic Realignment of Multinational Enterprises in Australia During Deglobalization, 1914–79

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, André Sammartino, Simon Ville, David Merrett, Monica Keneley   +4 more
wiley   +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 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  

Quantum annealing of the Traveling Salesman Problem

, 2004
We propose a path-integral Monte Carlo quantum annealing scheme for the symmetric Traveling Salesman Problem, based on a highly constrained Ising-like representation, and we compare its performance against standard thermal Simulated Annealing.
D. J. Wales, D. S. Johnson, Erio Tosatti, Giuseppe E. Santoro, Roman Martoňák   +4 more
core   +1 more source

Production routing decisions in a two‐echelon supply chain with multiple delivery modes

International Transactions in Operational Research, Volume 33, Issue 5, Page 3385-3421, September 2026.
Abstract We study an original two‐echelon production routing problem with multiple delivery modes (2E‐PRP‐MDM). In the first echelon, the primary production facility is tasked with satisfying the demands of two distinct entities: a set of warehouses and a set of customers through direct shipments. In the second echelon, warehouses become delivery hubs,
Rachida Benfedel, Fayçal Belkaid, Nadjib Brahimi   +2 more
wiley   +1 more source