Image de couverture de livre

A Polynomial-Time Heuristic for the Travelling Salesman Problem Verified Against Held-Karp

Fuente: Zenodo

Enregistré dans:

Détails bibliographiques
Auteur principal:	Aggarwal, Minakshi
Format:	Recurso digital
Langue:	anglais
Publié:	Zenodo 2025
Sujets:	Travelling Salesperson Problem(TSP), Polynomial-Time Algorithms, Structural Beam Search, Combinatorial Optimization, Heuristics, Complexity Analysis
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

The Combinatorial ANT System for Dynamic Combinatorial Optimization Problems
par: Jose Aguilar
Publié: (2005)

Hybrid Iterative Beam and Greedy Search for Efficient Permutation Flow Shop Scheduling
par: Arab, Hamza, et autres
Publié: (2025)

Renormalization Towers and the Local Connectivity of Julia Sets for Unicritical Polynomials
par: Revista, Zen, et autres
Publié: (2026)

Geometric based heuristic TSP
par: ben abdessalem, maher
Publié: (2025)

Intelligent Heuristic Techniques for the Optimization of the Transshipment and Storage Operations at Maritime Container Terminals
par:
Publié: (2017)

A Statistical comparative analysis of Simulated Annealing and Variable Neighborhood Search for the Geographic Clustering Problem
par: Beatriz Bernábe Loranca
Publié: (2011)

Two New Exact Methods for the Vertex Separation Problem
par: Héctor J. Fraire Huacuja
Publié: (2015)

An ACO approach for the Parallel Machines Scheduling Problem
par: Claudia Ruth Gatica
Publié: (2010)

Proving the Non-Equivalence of P and NP: A Logical Reductio ad Absurdum via Holographic Block-Height
par: li, shaoren
Publié: (2026)

Performance measurement of a solution for the travelling salesman problem for routing through the incorporation of service time variability
par: Dafne Lagos
Publié: (2019)

Improved Finite Difference Methods for Solving Second-Order Boundary Value Problems of Ordinary Differential Equations Using Chebyshev Polynomials
par: Enemoh, E. N., et autres
Publié: (2025)

Meta-Heuristic Algorithm based on Ant Colony Optimization Algorithm , Tabu Search and Project Scheduling Problem (PSP) for the Traveling Salesman Problem
par: Alejandro Fuentes-Penna
Publié: (2014)

Code and experiment data from the NeurIPS 2025 paper "Classical Planning with LLM-Generated Heuristics: Challenging the State of the Art with Python Code"
par: Corrêa, Augusto B., et autres
Publié: (2025)

The Law of Computational Impossibility (P vs NP)
par: Zain Al-Abedien, (Muhannad)
Publié: (2025)

Considerations on Applying Cross Entropy Methods to the Vehicle Routing Problem
par: Marta Cabo
Publié: (2015)

Modification of Haessler’s sequential heuristic procedure for the one-dimensional cutting stock problem with setup cost
par: Mateus Martin
Publié: (2018)

A Novel Constructive Routing Algorithm for Fleet Size and Mix Vehicle Routing Problem
par: Kenan KARAGUL
Publié: (2014)

A HYBRID HEURISTIC ALGORITHM FOR SOLVING THE RESOURCE CONSTRAINED PROJECT SCHEDULING PROBLEM (RCPSP)
par: Juan Carlos Rivera
Publié: (2013)

Continuity in an Environment of Perceptual Discontinuity: The Significance of the Algorithm in Exploitative Power.
par: Vigil, Peter J.
Publié: (1989)

Preliminary Applications and Validations of the Polynomial Operator E_k(x) in Economic and Financial Systems
par: Lucero Bravo, Francisco Javier
Publié: (2025)

EVOLUTIONARY ALGORITHM BASED ON SIMULATED ANNEALING FOR THE MULTI-OBJECTIVE OPTIMIZATION OF COMBINATORIAL PROBLEMS
par: Elias D. Nino Ruiz
Publié: (2013)

Constructive heuristic for the vertex bisection problem
par: Norberto Castillo-García
Publié: (2020)

A branch-and-cut algorithm for the one-commodity pickup and delivery location routing problem
par: Domínguez-Martín, Bencomo, et autres
Publié: (2023)

Design of Heuristic Algorithms for Hard Optimization
par: Taillard, Éric D.
Publié: (2022)

Impactos do relacionamento consumidor-marca no desempenho de vendedores no varejo
par: Cid Gonçalves Filho
Publié: (2018)

A Continuous-Time Perspective on Global Acceleration for Monotone Equation Problems
par: Lin, Tianyi, et autres
Publié: (2022)

Time complexity of the Analyst's Traveling Salesman algorithm
par: Ramirez, Anthony, et autres
Publié: (2022)

Combined Mutation Operators of Genetic Algorithm for the Travelling Salesman problem
par: Kusum Deep
Publié: (2011)

Long-term mean annual ground temperature data for permafrost
par: GTN-P
Publié: (2021)

Rossby-Haurwitz wave perturbations under tropical forcing
par: Pérez-García Ismael
Publié: (2014)

New 3D Diffusion Code Based on The Nodal Polynomial Expansion
par: Jadna Mara Santos Mendes
Publié: (2020)

GTN-P global mean annual ground temperature data for permafrost near the depth of zero annual amplitude (2007-2016)
par: GTN-P
Publié: (2018)

Algebraic IDA-PBC for Polynomial Systems with Input Saturation: An SOS-based Approach
par: Oscar B. Cieza A.
Publié: (2019)

Variant of partially mapped crossover for the Travelling Salesman problems
par: Kusum Deep
Publié: (2012)

Semiglobal Chaotification of One Class of n-Dimensional Continuous-Time Systems Via a Time-Delay Feedback
par: Konstantin Starkov
Publié: (2006)

From Chinese Postman to Salesman and Beyond II: Inapproximability and Parameterized Complexity
par: Frei, Fabian, et autres
Publié: (2025)

On the Q‐Polynomial Property of Bipartite Graphs Admitting a Uniform Structure
par: Blas Fernández, et autres
Publié: (2025)

A Control-Theoretic Perspective on Optimal High-Order Optimization
par: Lin, Tianyi, et autres
Publié: (2019)

Solving convex QPs with structured sparsity under indicator conditions
par: Bienstock, Daniel, et autres
Publié: (2024)

On the Distribution of Unweighted Minimum Knapsack Instances with Large SOS Rank
par: Kurpisz, Adam, et autres
Publié: (2026)