Pages that link to "Item:Q5624982"

The following pages link to Pathology of Traveling-Salesman Subtour-Elimination Algorithms (Q5624982):

Displaying 32 items.

• Models, relaxations and exact approaches for the capacitated vehicle routing problem (Q697581) (← links)
• Establishing motion correspondence using extended temporal scope (Q814453) (← links)
• Average-case analysis of best-first search in two representative directed acyclic graphs (Q814592) (← links)
• Maximum travelling salesman problem. I (Q891481) (← links)
• Lower bounds for the symmetric travelling salesman problem from Lagrangean relaxations (Q908860) (← links)
• On the stochastic complexity of the asymmetric traveling salesman problem (Q915656) (← links)
• The optimum assignments and a new heuristic approach for the traveling salesman problem (Q1051562) (← links)
• Methods for routing with time windows (Q1068008) (← links)
• An algorithm for the traveling salesman problem with pickup and delivery customers (Q1071656) (← links)
• Results from a parallel branch-and-bound algorithm for the asymmetric traveling salesman problem (Q1118534) (← links)
• Solving symmetric vehicle routing problems asymmetrically (Q1171005) (← links)
• An appraisal of computational complexity for operations researchers (Q1173532) (← links)
• An additive bounding procedure for the asymmetric travelling salesman problem (Q1184344) (← links)
• The traveling salesman problem: An overview of exact and approximate algorithms (Q1194761) (← 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)
• A note on the complexity of the asymmetric traveling salesman problem (Q1374382) (← links)
• Motion tracking as a constrained optimization problem. (Q1400498) (← links)
• Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems (Q1580967) (← links)
• Cluster based branching for the asymmetric traveling salesman problem (Q1806732) (← links)
• A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem (Q1870831) (← links)
• An exact algorithm for the capacitated shortest spanning arborescence (Q1908299) (← links)
• A new approach to solving the multiple traveling salesperson problem using genetic algorithms (Q2432849) (← links)
• The symmetric travelling salesman problem. I: New fast lower bounds for the problem of optimal 2-matching (Q2654962) (← links)
• A study of complexity transitions on the asymmetric traveling salesman problem (Q2674187) (← links)
• A restricted Lagrangean approach to the traveling salesman problem (Q3911684) (← links)
• Integer programming approaches to the travelling salesman problem (Q4105495) (← links)
• The traveling salesman problem: A duality approach (Q4156164) (← links)
• A continuous variable representation of the traveling salesman problem (Q4168793) (← links)
• A Fast Lower Bound for the Minimum Cost Perfect 2-Matching Linear Program (Q4305487) (← links)
• Some problems in discrete optimization (Q5636690) (← links)