Pages that link to "Item:Q5615771"

The following pages link to The Traveling Salesman Problem: A Survey (Q5615771):

Displaying 50 items.

• An efficient procedure for obtaining feasible solutions to the n-city traveling salesman problem (Q583125) (← links)
• On single courier problem (Q941049) (← links)
• Truncated \(M\)-travelling salesman problem (Q998696) (← links)
• The optimum assignments and a new heuristic approach for the traveling salesman problem (Q1051562) (← links)
• The maximum covering/shortest path problem: A multiobjective network design and routing formulation (Q1060958) (← links)
• An algorithm for the traveling salesman problem with pickup and delivery customers (Q1071656) (← links)
• A geometric problem involving the nearest neighbour algorithm (Q1094335) (← links)
• Probabilistic analysis of solving the assignment problem for the traveling salesman problem (Q1158107) (← links)
• On the expected number of optimal and near-optimal solutions to the Euclidean travelling salesman problem. I (Q1158109) (← links)
• Operational estimators for the length of a traveling salesman tour (Q1206381) (← links)
• Neighborhood search algorithms for guaranteeing optimal traveling salesman tours must be inefficient (Q1226033) (← links)
• Integer programming formulation of combinatorial optimization problems (Q1239086) (← links)
• On the solutions of stochastic traveling salesman problems (Q1247370) (← links)
• An approach for solving a class of transportation scheduling problems (Q1251987) (← links)
• The seriation problem and the travelling salesman problem (Q1252153) (← links)
• Scheduling in a sequence dependent setup environment with genetic search (Q1342322) (← links)
• A multisolution method for cell formation---exploring practical alternatives in group technology manufacturing (Q1591973) (← links)
• The traveling purchaser problem and its variants (Q1751767) (← links)
• Determination of optimal path under approach and exit constraints (Q1847171) (← links)
• Planning a multi-sensors search for a moving target considering traveling costs (Q2030597) (← links)
• Time window optimization for attended home service delivery under multiple sources of uncertainties (Q2108142) (← links)
• An exact method for scheduling a yard crane (Q2256284) (← links)
• Multiheuristic approach to discrete optimization problems (Q2371698) (← links)
• Particle swarm optimization-based algorithms for TSP and generalized TSP (Q2379966) (← links)
• Time-dependent travelling salesman problem. (Q2476429) (← links)
• Dynamic graph conv-LSTM model with dynamic positional encoding for the large-scale traveling salesman problem (Q2688704) (← links)
• Strategies for Generating Well Centered Tetrahedral Meshes on Industrial Geometries (Q2948920) (← links)
• The travelling salesman problem: selected algorithms and heuristics† (Q3033569) (← links)
• Probabilistic Analysis of Assignment Ranking: The Traveling Salesman Problems (Q3346092) (← links)
• COMPARATIVE STUDY OF SOME SOLUTION METHODS FOR TRAVELING SALESMAN PROBLEM USING GENETIC ALGORITHMS (Q3393512) (← links)
• A multi-agent approach for solving traveling salesman problem (Q3445983) (← links)
• A Comparative Study of Task Assignment and Path Planning Methods for Multi-UGV Missions (Q3589741) (← links)
• A MILP model for the<i>n</i>-job,<i>M</i>-stage flowshop with sequence dependent set-up times (Q3743087) (← links)
• A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows (Q3770308) (← links)
• A restricted Lagrangean approach to the traveling salesman problem (Q3911684) (← links)
• On the resources allocation problem (Q4034172) (← links)
• The travelling salesman problem and a class of polyhedra of diameter two (Q4081007) (← links)
• Integer programming approaches to the travelling salesman problem (Q4105495) (← links)
• Lineare Charakterisierungen von Travelling Salesman Problemen (Q4119037) (← links)
• Some theoretical implications of local optimization (Q4120335) (← links)
• The zero pivot phenomenon in transportation and assignment problems and its computational implications (Q4127627) (← links)
• A Simultaneous Enumeration Approach to the Traveling Salesman Problem (Q4152032) (← links)
• The adjacency relation on the traveling salesman polytope is NP-Complete (Q4153924) (← links)
• A continuous variable representation of the traveling salesman problem (Q4168793) (← links)
• Using cutting planes to solve the symmetric Travelling Salesman problem (Q4175048) (← links)
• Point estimation of a global optimum for large combinatorial problems (Q4181801) (← links)
• Optimierung des Schülerverkehrs durch gemischt ganzzahlige Programmierung (Q4190405) (← links)
• Biogeography migration algorithm for traveling salesman problem (Q4915778) (← links)
• On the Nearest-Neighbor Algorithm for the Mean-Field Traveling Salesman Problem (Q5416544) (← links)
• Some problems in discrete optimization (Q5636690) (← links)