TSP
No mentions found
This entity hasn't been tracked yet, or Iris is still building its knowledge base.
Related Articles from SNS
Towards Implementable Quantum Divide and Conquer: A TSP Solver with Improved Exponential Base over Held-Karp
Announce Type: cross Abstract: The traveling salesman problem (TSP) is a significant classical NP-hard combinatorial optimization problem. In this work, we demonstrate that combining classical dynamic programming with quantum search can yield an achievable quantum advantage for TSP on the basis of excellent work by the authors of~\cite{ambainis2019quantum}. We design the quantum divide and conquer strategy to provide a parameterized spectrum for this combination.
IDEQ -- Improving Diffusion Models for the Traveling Salesman Problem (TSP) by Leveraging the Structure of the Solution Space
arXiv:2412.13858v2 Announce Type: replace Abstract: We investigate diffusion models to solve the Traveling Salesman Problem. Building on the recent DIFUSCO and T2TCO approaches, we propose IDEQ. IDEQ improves the quality of the solutions by leveraging the constrained structure of the state space of the TSP.
Leveraging Structural Constraints for Diffusion-based Neural TSP Solvers
arXiv:2606.09343v1 Announce Type: new Abstract: Neural combinatorial optimization has recently achieved strong results on the Euclidean Traveling Salesman Problem (TSP) using generative models such as diffusion and consistency models. State-ofthe-art approaches like FT2T combine fast consistency-based prediction with gradient-based inference time refinement. However, gradient search often incurs significant computational overhead and may not align with the discrete structure of feasible...
Gooseberry pavlova
The tart berries with sweet meringue make a perfect summer dessert. Requires chilling and cooling time Overview 1 hr 20 mins 1 hr 30 mins 4 -5 For the meringue layer - 6 egg whites - 350g caster sugar - 1 tsp vanilla sugar or the vanilla seeds from 1 pod - 2 tsp cornflour - A few drops of vinegar For the pastry cream - 1 egg yolk - 1 whole egg - 30g cornflour - 80g caster sugar - ¼ tsp salt - 500ml whole milk - Seeds from 1 vanilla pod - 25g unsalted butter
Gooseberry kuchen with elderflower cream
‘Kuchen’ is German for cake, but it’s more of a pudding, I think. You could also use plums, pears, apples, pears or cranberries. Overview 20 mins 50 mins 6 Ingredients - 150g butter, plus extra for greasing - 275g gooseberries - 150g caster sugar - 1 large egg - 200ml sour cream - 225g plain flour - 2 tsp baking powder - finely grated zest of 1 lemon - ½ tsp vanilla extract - 2 tbsp granulated sugar For the cream - 300ml double cream - 3 tbsp elderflower cordial - 1 tbsp icing sugar Method...
Hybrid Metaheuristic Combining the Dragonfly Algorithm and Tabu Search for the Traveling Salesman Problem
Announce Type: new Abstract: The Traveling Salesman Problem (TSP) is a classical NP-hard combinatorial optimization problem that aims to find the shortest Hamiltonian cycle visiting each city exactly once and returning to the starting point. This paper proposes a hybrid metaheuristic for the TSP by combining the Dragonfly Algorithm (DA), a swarm-intelligence-based global search method, with Tabu Search (TS), a memory-based local search technique. The proposed method follows a High-Level...
ASAP: Exploiting the Satisficing Generalization Edge in Neural Combinatorial Optimization
Announce Type: replace Abstract: Deep Reinforcement Learning (DRL) has emerged as a promising approach for solving Combinatorial Optimization (CO) problems, such as the 3D Bin Packing Problem (3D-BPP), Traveling Salesman Problem (TSP), or Vehicle Routing Problem (VRP), but these neural solvers often exhibit brittleness when facing distribution shifts. To address this issue, we uncover the Satisficing Generalization Edge, which we validate both theoretically and experimentally: identifying a...
Blackberry and rosemary chocolate brownies
Rosemary is surprisingly good with chocolate – I’ve been making chocolate and rosemary pots for years – and it’s also good with berries and plums. Overview 25 mins 45 mins 9 Ingredients - 275g soft light-brown sugar - leaves from 1 sprig rosemary, chopped - 125g butter at room temperature, plus extra for greasing the tin - 200g dark chocolate (70 per cent) - 1 tsp vanilla extract - 2 large eggs, lightly beaten - 2 tbsp cocoa powder - 100g plain flour - ½ tbsp crème de mûre or crème de cassis...
MViewRouter: Internalizing Geometric Equivariance via Multi-view Alternating Attention for Combinatorial Routing
Announce Type: new Abstract: Combinatorial routing problems such as the Traveling Salesman Problem (TSP) and the Capacitated Vehicle Routing Problem (CVRP) are fundamental NP-hard problems with broad real-world applications. While recent deep reinforcement learning methods have shown promising performance, they typically handle geometric symmetries only through data augmentation, resulting in inconsistent decisions and limited generalization. To address this issue, we propose MViewRouter, a...
GOTabPFN: From Feature Ordering to Compact Tokenization for Tabular Foundation Models on High-Dimensional Data
arXiv:2606.05441v1 Announce Type: new Abstract: We investigate how to make small tabular foundation models effective for High-Dimensional, Low-Sample Size (HDLSS) tabular prediction without retraining large backbones. We introduce Graph-guided Ordering with Local Refinement (GO-LR), show its equivalence to weighted Minimum Linear Arrangement, and interpret the practical solver as a TSP-path-style surrogate. We propose GOTabPFN,which builds on GO-LR, and a Neuro-Inspired Subunit Compression...