Pages that link to "Item:Q2884557"

The following pages link to Tour Merging via Branch-Decomposition (Q2884557):

Displaying 39 items.

• Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization (Q342297) (← links)
• A combinatorial optimization algorithm for solving the branchwidth problem (Q429498) (← links)
• Catalan structures and dynamic programming in \(H\)-minor-free graphs (Q440008) (← links)
• Seeking global edges for traveling salesman problem in multi-start search (Q652693) (← links)
• Treewidth lower bounds with brambles (Q926284) (← links)
• Branchwidth of chordal graphs (Q967314) (← links)
• Computing branchwidth via efficient triangulations and blocks (Q967315) (← links)
• Semi-nice tree-decompositions: the best of branchwidth, treewidth and pathwidth with one algorithm (Q967316) (← links)
• Dynamic programming and planarity: improved tree-decomposition based algorithms (Q972340) (← links)
• Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane (Q1651693) (← links)
• Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions (Q1957653) (← links)
• POPMUSIC for the travelling salesman problem (Q1991147) (← links)
• A comparative analysis of two matheuristics by means of merged local optima networks (Q2029302) (← links)
• A relaxation of the directed disjoint paths problem: a global congestion metric helps (Q2055975) (← links)
• Adapting the directed grid theorem into an \textsf{FPT} algorithm (Q2132350) (← links)
• Deep policy dynamic programming for vehicle routing problems (Q2170197) (← links)
• Toward solving the Steiner travelling salesman problem on urban road maps using the branch decomposition of graphs (Q2282284) (← links)
• IntraClusTSP -- an incremental intra-cluster refinement heuristic algorithm for symmetric travelling salesman problem (Q2337843) (← links)
• Speeding up dynamic programming with representative sets: an experimental evaluation of algorithms for Steiner Tree on tree decompositions (Q2343089) (← links)
• Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth (Q2347800) (← links)
• Tree-width and the Sherali-Adams operator (Q2386210) (← links)
• Branch decomposition heuristics for linear matroids (Q2445840) (← links)
• Tree decomposition and discrete optimization problems: a survey (Q2480502) (← links)
• BWM*: A Novel, Provable, Ensemble-Based Dynamic Programming Algorithm for Sparse Approximations of Computational Protein Design (Q2814583) (← links)
• A SAT Approach to Branchwidth (Q2818011) (← links)
• A Local Search Algorithm for Branchwidth (Q3075536) (← links)
• On complexity of optimal recombination for flowshop scheduling problems (Q3186862) (← links)
• Genetic Algorithm with Optimal Recombination for the Asymmetric Travelling Salesman Problem (Q3297452) (← links)
• How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms (Q3508575) (← links)
• A Branch Decomposition Algorithm for the <i>p</i>-Median Problem (Q4599316) (← links)
• (Q5089157) (← links)
• Adapting the Directed Grid Theorem into an FPT Algorithm (Q5099098) (← links)
• Improving the Efficiency of Helsgaun’s Lin-Kernighan Heuristic for the Symmetric TSP (Q5458509) (← links)
• Uniform Constraint Satisfaction Problems and Database Theory (Q5504703) (← links)
• Slightly Superexponential Parameterized Problems (Q5745079) (← links)
• Combining metaheuristics with mathematical programming, constraint programming and machine learning (Q5891242) (← links)
• Combining metaheuristics with mathematical programming, constraint programming and machine learning (Q5925164) (← links)
• Tangle bases: Revisited (Q6087071) (← links)
• Hybridizations of evolutionary algorithms with large neighborhood search (Q6158769) (← links)