Pages that link to "Item:Q1612766"

The following pages link to The traveling salesman problem and its variations (Q1612766):

Displayed 36 items.

• Cut-and-solve: An iterative search strategy for combinatorial optimization problems (Q2457618) ‎ (← links)
• A criterion for the adjacency of vertices of polytopes generated by subsets of symmetric groups (Q2460490) ‎ (← links)
• On estimating the distribution of optimal traveling salesman tour lengths using heuristics (Q2462111) ‎ (← links)
• An approximation algorithm for a symmetric generalized multiple depot, multiple travelling salesman problem (Q2467447) ‎ (← links)
• Computing finest mincut partitions of a graph and application to routing problems (Q2473036) ‎ (← links)
• Traveling salesman path problems (Q2476987) ‎ (← links)
• The linear ordering problem with cumulative costs (Q2482806) ‎ (← links)
• An improved upper bound for the TSP in cubic 3-edge-connected graphs (Q2488197) ‎ (← links)
• Expanding neighborhood GRASP for the traveling salesman problem (Q2490365) ‎ (← links)
• On pedigree polytopes and Hamiltonian cycles (Q2497514) ‎ (← links)
• Facets and valid inequalities for the time-dependent travelling salesman problem (Q2514741) ‎ (← links)
• A review of TSP based approaches for flowshop scheduling (Q2572854) ‎ (← links)
• A note on single alternating cycle neighborhoods for the TSP (Q2573008) ‎ (← links)
• Fast local search algorithms for the handicapped persons transportation problem (Q2573013) ‎ (← links)
• An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem (Q2583134) ‎ (← links)
• Mathematical formulations for a 1-full-truckload pickup-and-delivery problem (Q2630253) ‎ (← links)
• Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics (Q2636833) ‎ (← links)
• Vehicle routing problems with alternative paths: an application to on-demand transportation (Q2654320) ‎ (← links)
• Generalized Model of Courier with Additional Restrictions (Q2806800) ‎ (← links)
• The Generalized Covering Salesman Problem (Q2815466) ‎ (← links)
• The Traveling Salesman Problem: Low-Dimensionality Implies a Polynomial Time Approximation Scheme (Q2817793) ‎ (← links)
• Approximation algorithms and heuristics for a 2-depot, heterogeneous Hamiltonian path problem (Q2903995) ‎ (← links)
• Online Graph Exploration: New Results on Old and New Algorithms (Q3012942) ‎ (← links)
• New exponential neighbourhood for polynomially solvable TSPs (Q3439139) ‎ (← links)
• Asymptotically optimal approach for solving some hard discrete optimization problems (Q3439515) ‎ (← links)
• A Simple LP Relaxation for the Asymmetric Traveling Salesman Problem (Q3541797) ‎ (← links)
• A Lagrangian-Based Algorithm for a Combinatorial Motion Planning Problem (Q3564143) ‎ (← links)
• Vehicle Routing Problems and Container Terminal Operations – An Update of Research (Q3564376) ‎ (← links)
• The ALGACEA‐1 method for the capacitated vehicle routing problem (Q3638856) ‎ (← links)
• Optimal path for automated drilling operations by a new heuristic approach using particle swarm optimization (Q4826246) ‎ (← links)
• The travelling salesman problem with neighbourhoods: MINLP solution (Q4924121) ‎ (← links)
• Randomized heuristics for the family traveling salesperson problem (Q4979987) ‎ (← links)
• New Bounds for the Traveling Salesman Constant (Q5246169) ‎ (← links)
• Analyses of advanced iterated tour partitioning heuristics for generalized vehicle routing problems (Q5326795) ‎ (← links)
• Cluster-level operations planning for the out-of-position robotic arc-welding (Q5478828) ‎ (← links)
• THE TSP AND THE SUM OF ITS MARGINAL VALUES (Q5485789) ‎ (← links)