Tour Merging via Branch-Decomposition
From MaRDI portal
Publication:2884557
DOI10.1287/ijoc.15.3.233.16078zbMath1238.90128OpenAlexW2167377888MaRDI QIDQ2884557
Publication date: 30 May 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.15.3.233.16078
Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27)
Related Items
Adapting the directed grid theorem into an \textsf{FPT} algorithm, Tree-width and the Sherali-Adams operator, On complexity of optimal recombination for flowshop scheduling problems, Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane, Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization, Deep policy dynamic programming for vehicle routing problems, Adapting the Directed Grid Theorem into an FPT Algorithm, Tangle bases: Revisited, How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms, A Branch Decomposition Algorithm for the p-Median Problem, Hybridizations of evolutionary algorithms with large neighborhood search, A combinatorial optimization algorithm for solving the branchwidth problem, Catalan structures and dynamic programming in \(H\)-minor-free graphs, Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions, Branch decomposition heuristics for linear matroids, Combining metaheuristics with mathematical programming, constraint programming and machine learning, Seeking global edges for traveling salesman problem in multi-start search, Treewidth lower bounds with brambles, Genetic Algorithm with Optimal Recombination for the Asymmetric Travelling Salesman Problem, POPMUSIC for the travelling salesman problem, Combining metaheuristics with mathematical programming, constraint programming and machine learning, Tree decomposition and discrete optimization problems: a survey, Branchwidth of chordal graphs, Computing branchwidth via efficient triangulations and blocks, Semi-nice tree-decompositions: the best of branchwidth, treewidth and pathwidth with one algorithm, Dynamic programming and planarity: improved tree-decomposition based algorithms, Slightly Superexponential Parameterized Problems, Unnamed Item, A comparative analysis of two matheuristics by means of merged local optima networks, Toward solving the Steiner travelling salesman problem on urban road maps using the branch decomposition of graphs, Improving the Efficiency of Helsgaun’s Lin-Kernighan Heuristic for the Symmetric TSP, A Local Search Algorithm for Branchwidth, BWM*: A Novel, Provable, Ensemble-Based Dynamic Programming Algorithm for Sparse Approximations of Computational Protein Design, A SAT Approach to Branchwidth, A relaxation of the directed disjoint paths problem: a global congestion metric helps, Uniform Constraint Satisfaction Problems and Database Theory, IntraClusTSP -- an incremental intra-cluster refinement heuristic algorithm for symmetric travelling salesman problem, Speeding up dynamic programming with representative sets: an experimental evaluation of algorithms for Steiner Tree on tree decompositions, Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
