Pages that link to "Item:Q4173216"

The following pages link to Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane (Q4173216):

Displaying 50 items.

• On a new edge function on complete weighted graphs and its application for locating Hamiltonian cycles of small weight (Q315484) (← links)
• A lookahead partitioning heuristic for a new assignment and scheduling problem in a distribution system (Q421661) (← links)
• Random shortest paths: non-Euclidean instances for metric optimization problems (Q494931) (← links)
• Survivable networks, linear programming relaxations and the parsimonious property (Q689117) (← links)
• Competitive location in the plane (Q689241) (← links)
• Combinatorial optimisation algorithms for a CAD workstation (Q750305) (← links)
• Heuristic combinatorial optimization by simulated Darwinian evolution: A polynomial time algorithm for the traveling salesman problem (Q757282) (← links)
• A partitioning algorithm for minimum weighted Euclidean matching (Q794175) (← links)
• Partitioning heuristics for two geometric maximization problems (Q800827) (← links)
• A note on asymptotic formulae for one-dimensional network flow problems (Q867547) (← links)
• The Hamiltonian p-median problem (Q918861) (← links)
• A comparison of problem decomposition techniques for the FAP (Q972658) (← links)
• An approximate algorithm for a high-multiplicity parallel machine scheduling problem (Q991471) (← links)
• Convergence of optimal stochastic bin packing (Q1062627) (← links)
• Probabilistic asymptotic properties of some combinatorial optimization problems (Q1067976) (← links)
• Maximal paths in random dynamic graphs (Q1104336) (← links)
• Quantizers ad the worst case Euclidean traveling salesman problem (Q1111946) (← links)
• Discrete extremal problems (Q1152306) (← links)
• Probabilistic analysis of solving the assignment problem for the traveling salesman problem (Q1158107) (← links)
• Probabilistic analysis of combinatorial algorithms: A bibliography with selected annotations (Q1162147) (← links)
• An O(N log N) planar travelling salesman heuristic based on spacefilling curves (Q1166433) (← links)
• An appraisal of computational complexity for operations researchers (Q1173532) (← links)
• A primer of the Euclidean Steiner problem (Q1179729) (← links)
• Euclidean semi-matchings of random samples (Q1184341) (← links)
• New scaling algorithms for the assignment and minimum mean cycle problems (Q1190599) (← links)
• Nested annealing: A provable improvement to simulated annealing (Q1193895) (← links)
• Polynomial-time instances of the minimum weight triangulation problem (Q1314524) (← links)
• Rate of convergence for the Euclidean minimum spanning tree limit law (Q1317005) (← links)
• The travelling salesman problem with pick-up and delivery (Q1342068) (← links)
• Boundary effects in the traveling salesperson problem (Q1342090) (← links)
• The general multi-retailer EOQ problem with vehicle routing costs (Q1342645) (← links)
• Average performance of greedy heuristics for the integer knapsack problem. (Q1420409) (← links)
• Solving large-scale TSP using a fast wedging insertion partitioning approach (Q1666767) (← links)
• Continuous approximation models in freight distribution management (Q1688432) (← links)
• Local search for the Steiner tree problem in the Euclidean plane (Q1806730) (← links)
• Heuristic methods and applications: A categorized survey (Q1823879) (← links)
• The simple plant location problem: Survey and synthesis (Q1837098) (← links)
• On properties of geometric random problems in the plane (Q1908291) (← links)
• Dynamic vehicle routing: Status and prospects (Q1908300) (← links)
• Divide and conquer strategies for parallel TSP heuristics (Q1919776) (← links)
• A hierarchical strategy for solving traveling salesman problems using elastic nets (Q1922629) (← links)
• Approximation algorithms for tree alignment with a given phylogeny (Q1924406) (← links)
• Computing the variance of tour costs over the solution space of the TSP in polynomial time (Q1935572) (← links)
• Smoothed analysis of partitioning algorithms for Euclidean functionals (Q1950395) (← links)
• Hamiltonian cycle curves in the space of discounted occupational measures (Q2095221) (← links)
• The simultaneous semi-random model for TSP (Q2164675) (← links)
• Multiple \(k\)-opt evaluation multiple \(k\)-opt moves with GPU high performance local search to large-scale traveling salesman problems (Q2188765) (← links)
• IntraClusTSP -- an incremental intra-cluster refinement heuristic algorithm for symmetric travelling salesman problem (Q2337843) (← links)
• An introduction to population approaches for optimization and hierarchical objective functions: A discussion on the role of tabu search (Q2366996) (← links)
• The performance of forwards induction policies (Q2368171) (← links)