:: Library Catalog

صورة الغلاف

محفوظ في:

التفاصيل البيبلوغرافية
المؤلف الرئيسي:	ben abdessalem, maher
التنسيق:	Recurso digital
اللغة:	الإنجليزية
منشور في:	Zenodo 2025
الموضوعات:	Traveling Salesman Problem Computational Geometry Heuristics 2-opt Candi- date Sets Randomized Algorithms graph theory Applied mathematics Graph theory
الوصول للمادة أونلاين:	https://doi.org/10.5281/zenodo.17640906
الوسوم:	إضافة وسم لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!

مواد مشابهة

Grafos hamiltonianos aplicado al turismo de Panamá.
حسب: Julio Enrique Trujillo González
منشور في: (2019)

Statistical distributions of quasi-optimal paths in the traveling salesman problem: the role of the initial distribution of cities
حسب: H. Hernández-Saldaña
منشور في: (2012)

Combined Mutation Operators of Genetic Algorithm for the Travelling Salesman problem
حسب: Kusum Deep
منشور في: (2011)

A Polynomial-Time Heuristic for the Travelling Salesman Problem Verified Against Held-Karp
حسب: Aggarwal, Minakshi
منشور في: (2025)

Theory and Applications of Graphs
منشور في: (2018)

Asymptotic Saturation of Projective Resolution: Expander Relaxation Graphs
حسب: Beau, Jérôme
منشور في: (2026)

Asymptotic Saturation of Projective Resolution: Expander Relaxation Graphs
حسب: Beau, Jérôme
منشور في: (2026)

Majalah Ilmiah Matematika dan Statistika
منشور في: (2023)

The American Journal of Combinatorics
منشور في: (2023)

A Spectral Rank-Loss Criterion for Intrinsic Structural Order in Hierarchical Correlative Structures
حسب: Bédrouni, Smaïn
منشور في: (2026)

Transactions on Combinatorics
منشور في: (2013)

Meta-Heuristic Algorithm based on Ant Colony Optimization Algorithm , Tabu Search and Project Scheduling Problem (PSP) for the Traveling Salesman Problem
حسب: Alejandro Fuentes-Penna
منشور في: (2014)

Ars Mathematica Contemporanea
منشور في: (2025)

A methodology for creating Feeding routes in mass transit systems
حسب: Daniela Ospina-Toro
منشور في: (2017)

A Statistical comparative analysis of Simulated Annealing and Variable Neighborhood Search for the Geographic Clustering Problem
حسب: Beatriz Bernábe Loranca
منشور في: (2011)

Constructive heuristic for the vertex bisection problem
حسب: Norberto Castillo-García
منشور في: (2020)

Modification of Haessler’s sequential heuristic procedure for the one-dimensional cutting stock problem with setup cost
حسب: Mateus Martin
منشور في: (2018)

Spectrum and local weak convergence of sparse random uniform hypergraphs
حسب: Adhikari, Kartick, وآخرون
منشور في: (2025)

About the Dedekind psi function in Pauli graphs
حسب: M. Planat
منشور في: (2011)

NEW BOUNDS FOR LAPLACIAN ENERGY
حسب: Ivan Gutman
منشور في: (2020)

An Analysis of the Use of Graphs in People's Daily Life
حسب: José David Zaldívar-Rojas
منشور في: (2021)

Trajectory Graphs Appearing from the Skein Problems at the Hypercube
حسب: Feliú Salgols
منشور في: (2016)

A new sum of graphs and caterpillar trees
حسب: N. B. HUAMANÍ
منشور في: (2022)

Collatz Conjecture: A Reverse Construction Bijective Proof via Layered Directed Acyclic Graphs
حسب: Aaron Brolin Fish
منشور في: (2025)

Behavioral Finance in Brazil: applying the prospect theory to potential investors
حسب: Claudia Emiko Yoshinaga
منشور في: (2014)

Chapter On a theorem of Erdős and Simonovits on graphs not containing the cube
حسب: Füredi, Zoltán
منشور في: (2019)

Mexico City Flight Route Optimization: Operations Management Challenge
حسب: Humberto DORANTES BENAVIDEZ
منشور في: (2020)

Geometric constraint subsets and subgraphs in the analysis of assemblies and mechanisms
حسب: Oscar E. Ruiz
منشور في: (2006)

The Graceful Tree Conjecture
حسب: Keen, Joseph
منشور في: (2026)

Spectral properties of hierarchical pseudo-Hermitian operators: numerical evidence for convergence to the critical line
حسب: Savenkov, Roman
منشور في: (2026)

Journal of Algebra and Related Topics
منشور في: (2015)

Low-Exponential Algorithm for Counting the Number of Edge Cover on Simple Graphs
حسب: José A. Hernández-Servín
منشور في: (2017)

Construction of Semi-Regular GraphsGraph theory is widely used to prove many mathematical theorems and models. This paper presents the various techniques of semi-regular graphs to solve problems in different fields of technology in addition to mathematics. We describe different classes of semi-regular graphs and their properties. Further, the paper includes the construction of such graphs and concepts like distance symmetry, k₂ + n, and kₙ + 1. Applications and structural illustrations are discussed in detail.
حسب: H, AfrinRihana, وآخرون
منشور في: (2025)

A Unimodal Conjecture Related the Quadruple Sequence on the Series
حسب: Yang, Limin
منشور في: (2026)

PROPAGATE: A Seed Propagation Framework to Compute Distance-Based Metrics on Very Large Graphs
حسب: Amati, Giambattista, وآخرون
منشور في: (2026)

An ACO approach for the Parallel Machines Scheduling Problem
حسب: Claudia Ruth Gatica
منشور في: (2010)

Matching minors in bipartite graphs
حسب: Wiederrecht, Sebastian
منشور في: (2022)

Design of Heuristic Algorithms for Hard Optimization
حسب: Taillard, Éric D.
منشور في: (2022)

Considerations on Applying Cross Entropy Methods to the Vehicle Routing Problem
حسب: Marta Cabo
منشور في: (2015)

Intelligent Heuristic Techniques for the Optimization of the Transshipment and Storage Operations at Maritime Container Terminals
حسب:
منشور في: (2017)