Pages that link to "Item:Q3893692"

The following pages link to Approximate Traveling Salesman Algorithms (Q3893692):

Displaying 38 items.

• A diagonal completion and 2-optimal procedure for the travelling salesman problem (Q583126) (← links)
• Tourenplanung für zwei Depots bei offenen Touren (Q788646) (← links)
• A parallel insert method for the capacitated arc routing problem (Q794931) (← links)
• A comparison of techniques for solving the fleet size and mix vehicle routing problem (Q800225) (← links)
• Multiple stack branch and bound (Q922704) (← links)
• A tabu search approach to an urban transport problem in northern Spain (Q955629) (← links)
• A useful transform of standard input data for a classical NP-complete problem (Q1058470) (← links)
• On the relationship of approximation algorithms for the minimum and the maximum traveling salesman problem (Q1078097) (← links)
• The fleet size and mix vehicle routing problem (Q1085780) (← links)
• Heuristics and their design: A survey (Q1152854) (← links)
• Verschnittoptimierung im praktischen Einsatz. Eine Fallstudie (Q1168886) (← links)
• Reducing reexpansions in iterative-deepening search by controlling cutoff bounds (Q1187216) (← links)
• Locating concentrators in centralized computer networks (Q1197789) (← links)
• On the complexity of generating synchronizable test sequences (Q1203646) (← links)
• Operational estimators for the length of a traveling salesman tour (Q1206381) (← links)
• Genetic algorithms and traveling salesman problems (Q1268132) (← links)
• An empirical study of a new metaheuristic for the traveling salesman problem (Q1291637) (← links)
• A model for warehouse order picking (Q1291697) (← links)
• Set-up saving schemes for printed circuit boards assembly (Q1309999) (← links)
• A two-dimensional mapping for the traveling salesman problem (Q1324376) (← links)
• Asymptotic expected performance of some TSP heuristics: An empirical evaluation (Q1823875) (← links)
• Heuristic methods and applications: A categorized survey (Q1823879) (← links)
• Computational efficiency and interactive MOLP algorithms: An implementation of the SIMOLP procedure (Q1825145) (← links)
• Determination of optimal path under approach and exit constraints (Q1847171) (← links)
• A computational tool for optimizing the urban public transport: A real application (Q2017562) (← links)
• Angular bisector insertion algorithm for solving small-scale symmetric and asymmetric traveling salesman problem (Q2075470) (← links)
• IntraClusTSP -- an incremental intra-cluster refinement heuristic algorithm for symmetric travelling salesman problem (Q2337843) (← links)
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) (Q2644426) (← links)
• On the method of interchanging networks for permutation problems (Q3030589) (← links)
• Evaluation of Heuristic Algorithms for the TSP: A New Statistical Approach (Q3217446) (← links)
• One-to-Many-to-One Single Vehicle Pickup and Delivery Problems (Q3564364) (← links)
• Scheduling Large-Scale Advance-Request Dial-A-Ride Systems (Q3771951) (← links)
• Point estimation of a global optimum for large combinatorial problems (Q4181801) (← links)
• A hybrid algorithm for TSP (Q4229562) (← links)
• Lower Bounds for Insertion Methods for TSP (Q4314147) (← links)
• Shuffling heuristics for the storage location assignment in an AS/RS (Q4399000) (← links)
• Global strategies for augmenting the efficiency of TSP heuristics (Q5060118) (← links)
• Time complexity of the analyst's traveling salesman algorithm (Q6200929) (← links)