Pages that link to "Item:Q3863432"

The following pages link to A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem (Q3863432):

Displaying 50 items.

• Distributionally robust mixed integer linear programs: persistency models with applications (Q296964) (← links)
• Ordered spatial sampling by means of the traveling salesman problem (Q333365) (← links)
• A survey of very large-scale neighborhood search techniques (Q697563) (← links)
• Match twice and stitch: a new TSP tour construction heuristic. (Q703270) (← links)
• A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem (Q857330) (← links)
• On the relationship between ATSP and the cycle cover problem (Q868952) (← links)
• Random assignment problems (Q953417) (← links)
• Production setup-sequencing and lot-sizing at an animal nutrition plant through ATSP subtour elimination and patching (Q964867) (← links)
• Randomized gravitational emulation search algorithm for symmetric traveling salesman problem (Q990542) (← links)
• Average-case approximation ratio of the 2-opt algorithm for the TSP (Q1015301) (← links)
• The optimum assignments and a new heuristic approach for the traveling salesman problem (Q1051562) (← links)
• Probabilistic asymptotic properties of some combinatorial optimization problems (Q1067976) (← links)
• On the relationship of approximation algorithms for the minimum and the maximum traveling salesman problem (Q1078097) (← links)
• The asymptotic behaviour of quadratic sum assignment problems: A statistical mechanics approach (Q1080365) (← links)
• Results from a parallel branch-and-bound algorithm for the asymmetric traveling salesman problem (Q1118534) (← links)
• Probabilistic analysis of combinatorial algorithms: A bibliography with selected annotations (Q1162147) (← links)
• The traveling salesman problem: An overview of exact and approximate algorithms (Q1194761) (← links)
• A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems (Q1194853) (← links)
• An approximation algorithm for the asymmetric travelling salesman problem with distances one and two (Q1209363) (← links)
• Modeling and solving several classes of arc routing problems as traveling salesman problems (Q1374032) (← links)
• A note on the complexity of the asymmetric traveling salesman problem (Q1374382) (← links)
• Polynomially solvable cases of the traveling salesman problem and a new exponential neighborhood (Q1805008) (← links)
• Cluster based branching for the asymmetric traveling salesman problem (Q1806732) (← links)
• On patching algorithms for random asymmetric travelling salesman problems (Q1813831) (← links)
• Approximation algorithms for the shortest common superstring problem (Q1822981) (← links)
• A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem (Q1870831) (← links)
• Minimean optimal key arrangements in hash tables (Q1900894) (← links)
• Alternative mathematical models and solution approaches for lot-sizing and scheduling problems in the brewery industry: analyzing two different situations (Q1993026) (← links)
• Typical values of extremal-weight combinatorial structures with independent symmetric weights (Q2111788) (← links)
• Hybrid matheuristics to solve the integrated lot sizing and scheduling problem on parallel machines with sequence-dependent and non-triangular setup (Q2239950) (← links)
• A cutting plane method for risk-constrained traveling salesman problem with random arc costs (Q2274859) (← links)
• An introduction to population approaches for optimization and hierarchical objective functions: A discussion on the role of tabu search (Q2366996) (← links)
• On the longest path of a randomly weighted tournament (Q2399297) (← links)
• Determination of the candidate arc set for the asymmetric traveling salesman problem (Q2485161) (← links)
• Iterative patching and the asymmetric traveling salesman problem (Q2494813) (← links)
• A review of TSP based approaches for flowshop scheduling (Q2572854) (← links)
• Epsilon-transformation: exploiting phase transitions to solve combinatorial optimization problems (Q2674191) (← links)
• The ?(2) limit in the random assignment problem (Q2746215) (← links)
• A survey on combinatorial optimization in dynamic environments (Q2907959) (← links)
• Genetic Algorithm with Optimal Recombination for the Asymmetric Travelling Salesman Problem (Q3297452) (← links)
• The asymptotic probabilistic behaviour of quadratic sum assignment problems (Q3668301) (← links)
• Sharp bounds for Karp's “patching”-algorithm for the approximate solution of the traveling salesman problem (Q3730367) (← links)
• On random quadratic bottleneck assignment problems (Q3938840) (← links)
• On Edge-Disjoint Spanning Trees in a Randomly Weighted Complete Graph (Q4643315) (← links)
• Combinação de abordagens GLSP e ATSP para o problema de dimensionamento e sequenciamento de lotes de produção de suplementos para nutrição animal (Q4905621) (← links)
• On the number of<i>k</i>-cycles in the assignment problem for random matrices (Q5239474) (← links)
• Efficient preprocessing methods for tabu search: an application on asymmetric travelling salesman problem (Q5881498) (← links)
• Construction heuristics for the asymmetric TSP. (Q5928379) (← links)
• A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times (Q5943566) (← links)
• Quantum optimization (Q5946294) (← links)