Pages that link to "Item:Q5543949"

The following pages link to An Algorithm for the Traveling Salesman Problem (Q5543949):

Displaying 50 items.

• On the identifiability of Bayesian factor analytic models (Q113012) (← links)
• Methods of multiextremal optimization under constraints for separably quasimonotone functions (Q357786) (← links)
• Choosing optimal road trajectory with random work cost in different areas (Q384698) (← links)
• Dominance rules in combinatorial optimization problems (Q421551) (← links)
• Extremal values of global tolerances in combinatorial optimization with an additive objective function (Q453633) (← links)
• Problem of successive megalopolis traversal with the precedence conditions (Q463382) (← links)
• An exact algorithm for the clustered travelling salesman problem (Q505157) (← links)
• Exact methods for solving the elementary shortest and longest path problems (Q512936) (← links)
• A survey of the operational use of ILP models (Q537604) (← links)
• Broadening the integer programming audience, the LINDO perspective (Q537610) (← links)
• Probabilistic subproblem selection in branch-and-bound algorithms (Q557739) (← links)
• An efficient procedure for obtaining feasible solutions to the n-city traveling salesman problem (Q583125) (← links)
• A diagonal completion and 2-optimal procedure for the travelling salesman problem (Q583126) (← links)
• An improved branch and bound algorithm for minimum concave cost network flow problems (Q686988) (← links)
• The symmetric clustered traveling salesman problem (Q759661) (← links)
• Genetic algorithms applied to the solution of hybrid optimal control problems in astrodynamics (Q835788) (← links)
• Dynamic programming and board games: a survey (Q853003) (← links)
• A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem (Q857330) (← links)
• Lower bounds for the symmetric travelling salesman problem from Lagrangean relaxations (Q908860) (← links)
• The use of state space relaxation for the dynamic facility location problem (Q920008) (← links)
• Repulsive assignment problem (Q963661) (← links)
• The optimum assignments and a new heuristic approach for the traveling salesman problem (Q1051562) (← links)
• An algorithm for the traveling salesman problem with pickup and delivery customers (Q1071656) (← links)
• An upper bound for the speedup of parallel best-bound branch-and-bound algorithms (Q1072940) (← links)
• The facility layout problem (Q1088577) (← links)
• Branch-and-bound and parallel computation: A historical note (Q1099088) (← links)
• Results from a parallel branch-and-bound algorithm for the asymmetric traveling salesman problem (Q1118534) (← links)
• Time-cost tradeoff in a three-dimensional assignment problem (Q1123126) (← links)
• Multiple and bicriteria scheduling: A literature survey (Q1130028) (← links)
• Multiobjective network scheduling with efficient use of renewable and nonrenewable resources (Q1150305) (← links)
• Heuristics and their design: A survey (Q1152854) (← links)
• A survey of scheduling methods for multiprocessor systems (Q1153687) (← links)
• A branch and bound algorithm for minimizing the expected cost of testing coherent systems (Q1155505) (← links)
• A heuristic procedure for solving the quadratic assignment problem (Q1158105) (← links)
• Probabilistic analysis of solving the assignment problem for the traveling salesman problem (Q1158107) (← links)
• Reducing reexpansions in iterative-deepening search by controlling cutoff bounds (Q1187216) (← 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 approach for solving a class of transportation scheduling problems (Q1251987) (← links)
• The seriation problem and the travelling salesman problem (Q1252153) (← links)
• A characterization of linear admissible transformations for the m- travelling salesmen problem: A result of Berenguer (Q1253610) (← links)
• Procedures for travelling salesman problems with additional constraints (Q1253617) (← links)
• A characterization of linear admissible transformations for the m- travelling salesmen problem (Q1257826) (← links)
• Computational comparison on the partitioning strategies in multiple choice integer programming (Q1266577) (← links)
• A branch and bound algorithm for the traveling purchaser problem (Q1278659) (← links)
• An empirical study of a new metaheuristic for the traveling salesman problem (Q1291637) (← links)
• Efficiency considerations in the implementation of parallel branch-and- bound (Q1309863) (← links)
• Set-up saving schemes for printed circuit boards assembly (Q1309999) (← links)
• A two-dimensional mapping for the traveling salesman problem (Q1324376) (← links)
• A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach (Q1628068) (← links)