Results 61 to 70 of about 8,730 (184)

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, Sándor P. Fekete, David S. Johnson 0001, Arie Tamir, Gerhard J. Woeginger, Russell Woodroofe   +5 more
openaire   +4 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

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

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

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

A formulation and a metaheuristic approach for the clustered vehicle routing problem with d‐relaxed priority rule

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, Silvio Alexandre de Araujo   +1 more
wiley   +1 more source

The selective travelling salesman problem

Discrete Applied Mathematics, 1990
This paper deals with exact solutions for the Selective Traveling Salesman Problem - a TSP with profit at the nodes - by branch-and bound. The contribution is in the form of a new upper bound calculation as well as two node partitioning rules.
Gilbert Laporte, Silvano Martello
openaire   +2 more sources

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, Kathrin Klamroth, Pedro Martins, Luís Paquete   +3 more
wiley   +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

The Symmetric Traveling Salesman Problem

CoRR, 2005
Let M be an nXn symetric matrix, n, even, T, an upper bound for T_OPT, an optimal tour, sigma_T, the smaller-valued perfect matching obtained from alternate edges of T expressed as a product of 2-cycles. Applying the modified Floyd-Warshall algorithm to (sigma_T)^-1M^-, we construct acceptable and 2-circuit cycles some sets of which may yield circuits ...
openaire   +3 more sources