Results 81 to 90 of about 11,422 (178)
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
Multi-UAV Formation Path Planning Based on Compensation Look-Ahead Algorithm
DronesThis study primarily studies the shortest-path planning problem for unmanned aerial vehicle (UAV) formations under uncertain target sequences. In order to enhance the efficiency of collaborative search in drone clusters, a compensation look-ahead ...
Tianye Sun +3 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
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
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 ...
Sharma, Megha, Ghosh, Diptesh
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
Elitist Ant System with 2-opt Local Search for the Traveling Salesman Problem
Advances in Electrical and Computer Engineering, 2012 The Traveling Salesman Problem is one of the most famous problems in combinatorial optimization. The paper presents an algorithm based upon the elitist ant system for solving the traveling salesman problem.
MARTINOVIC, G., BAJER, D.
doaj +1 more source
New neighborhood structures for the Double Traveling Salesman Problem with Multiple Stacks
, 2009 Traveling Salesman Problem, Metaheuristics, Neighborhood structures, Precedence constraints, LIFO loading, 90C27,
G. Tirado +5 more
core +1 more source
Domination Analysis of Greedy Heuristics For The Frequency Assignment Problem
, 2003 We introduce the greedy expectation algorithm for the fixed spectrum version of the frequency assignment problem. This algorithm was previously studied for the travelling salesman problem.
Noble, SD +6 more
core +1 more source
A review of the Tabu Search Literature on Traveling Salesman Problems [PDF]
The Traveling Salesman Problem (TSP) is one of the most widely studied problems inrncombinatorial optimization. It has long been known to be NP-hard and hence research onrndeveloping algorithms for the TSP has focused on approximate methods in addition ...
Sumanta Basu, Ghosh, Diptesh
core