Skip to content
Descubridor Institucional UMAR
Inicio
Búsqueda avanzada
Explorar
Inicio
Búsqueda avanzada
Explorar
Login
Language
English
Deutsch
Español
Français
Italiano
All Fields
Title
Author
Subject
Call Number
ISBN/ISSN
Tag
Find
Advanced
A Polynomial-Time Heuristic for the Travelling Salesman Problem Verified Against Held-Karp
A Polynomial-Time Heuristic for the Travelling Salesman Problem Verified Against Held-Karp
Fuente:
Zenodo
Saved in:
Bibliographic Details
Main Author:
Aggarwal, Minakshi
Format:
Recurso digital
Language:
English
Published:
Zenodo
2025
Subjects:
Travelling Salesperson Problem(TSP), Polynomial-Time Algorithms, Structural Beam Search, Combinatorial Optimization, Heuristics, Complexity Analysis
Online Access:
Acceder al recurso
Tags:
Add Tag
No Tags, Be the first to tag this record!
Cite this
Text this
Email this
Print
Export Record
Export to RefWorks
Export to EndNoteWeb
Export to EndNote
Save to List
Permanent link
Holdings
Description
Comments
Similar Items
Staff View
Internet
https://doi.org/10.5281/zenodo.17018248
Similar Items
The Combinatorial ANT System for Dynamic Combinatorial Optimization Problems
by: Jose Aguilar
Published: (2005)
Hybrid Iterative Beam and Greedy Search for Efficient Permutation Flow Shop Scheduling
by: Arab, Hamza, et al.
Published: (2025)
Renormalization Towers and the Local Connectivity of Julia Sets for Unicritical Polynomials
by: Revista, Zen, et al.
Published: (2026)
Geometric based heuristic TSP
by: ben abdessalem, maher
Published: (2025)
Intelligent Heuristic Techniques for the Optimization of the Transshipment and Storage Operations at Maritime Container Terminals
by:
Published: (2017)