Results 81 to 90 of about 4,732 (227)
An Algorithm for the Traveling Salesman Problem [PDF]
Operations Research, 1963 A “branch and bound” algorithm is presented for solving the traveling salesman problem. The set of all tours (feasible solutions) is broken up into increasingly small subsets by a procedure called branching. For each subset a lower bound on the length of the tours therein is calculated.
Little, J. D. C. +3 more
openaire +2 more sources
Directed travelling salesman problem
, 1986 Considers an exactly soluble directed travelling salesman problem, where the salesman is forbidden to move, during its visit to the cities, opposite to a particular direction.
Chakrabarti, B. K.
core +1 more source
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
Techno.ComLembaga Amil Zakat, Infaq, dan Sadaqah Muhammadiyah (Lazismu) di Pontianak Tenggara menghadapi kendala operasional dalam pengambilan donasi dari kotak infaq yang tersebar di berbagai lokasi.
Iskandar Hadiatma +2 more
doaj +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 +2 more
wiley +1 more source
The 2-period balanced traveling salesman problem [PDF]
In the 2-period Balanced Traveling Salesman Problem (2B-TSP), the customers must be visited over a period of two days: some must be visited daily, and the others on alternate days (even or odd days); moreover, the number of customers visited in every ...
Francesco Mason, Tatiana Bassetto
core
Ordered Median Traveling Salesman Problem
Networks, Volume 88, Issue 1, Page 59-84, July 2026.ABSTRACT This paper introduces a novel combinatorial optimization problem with ordering constraints, termed the Ordered Median Traveling Salesman Problem (OMTSP). The OMTSP integrates key elements from both the classic Traveling Salesman Problem (TSP) and the Ordered Median Location Problem.
Ivana Ljubić +3 more
wiley +1 more source
, 2000 In this thesis, we study neighbourhoods of exponential size that can be searched in polynomial time. Such neighbourhoods are used in local search algorithms for classes of combinatorial optimisation problems.
Congram, Richard K., Congram, R.K.
core
Navigating Knowledge: Effects of State Curiosity on Children's Word Learning and Information Seeking
Developmental Science, Volume 29, Issue 4, July 2026.ABSTRACT Early learning takes place within complex, multimodal environments where curiosity plays a critical role in guiding exploratory behaviors and supporting cognitive development. While trait curiosity shapes children's early learning experiences, state curiosity is context‐dependent fostering early learning, in‐part, through information seeking ...
Anna Caunt +3 more
wiley +1 more source
A Comparative Performance Analysis of Computational Intelligence Techniques to Solve the Asymmetric Travelling Salesman Problem. [PDF]
Comput Intell Neurosci, 2021 Odili JB, Noraziah A, Zarina M.
europepmc +1 more source