Pages that link to "Item:Q1118534"

The following pages link to Results from a parallel branch-and-bound algorithm for the asymmetric traveling salesman problem (Q1118534):

Displaying 13 items.

• Solution of large dense transportation problems using a parallel primal algorithm (Q922946) (← links)
• Implementation of parallel branch-and-bound algorithms --- experiences with the graph partitioning problem (Q1179744) (← 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)
• New edges not used in shortest tours of TSP (Q1291639) (← links)
• Experiments with parallel branch-and-bound algorithms for the set covering problem (Q1316095) (← links)
• A TSSP+1 decomposition strategy for the vehicle routing problem (Q1342652) (← links)
• SelfSplit parallelization for mixed-integer linear programming (Q1652584) (← links)
• A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem (Q1870831) (← links)
• Routing problems: A bibliography (Q1908308) (← links)
• Parameter tuning for a cooperative parallel implementation of process-network synthesis algorithms (Q2418170) (← links)
• A distributed computation algorithm for solving portfolio problems with integer variables (Q2462177) (← links)
• Optimality conditions to the acyclic travelling salesman problem. (Q2467841) (← links)