D.L. Miller, J.F. Pekny (1989). Results from a parallel branch and bound algorithm for the asymmetric traveling salesman problem. Oper. Res. Lett. 8, 129--135. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Scalable Global and Local Hashing Strategies for Duplicate.. - Mahapatra, Dutt (1995) (3 citations) (Correct)
.... city i to city j) Thus, u 4 Since the focus of this paper is on the design and evaluation of general duplicate pruning strategies for parallel A algorithms that can be applied to most COP s, we have employed simple heuristic functions as opposed to a tighter heuristic function possible for TSP [22]. In Secs. 6 and 7, we will see that while a different heuristic function can affect the total number of duplicate nodes generated, it will not have any impact on the pruning capabilities of our strategies since they prune all duplicates. 4 and v would be considered to represent two different ....
....trying to parallelize node expansions in such cases may 19 deteriorate performance, since then parallelization overheads may become significant compared to node expansion computation. But for situations in which y is comparable to x, as is the case when the assignment heuristic is used for TSP [22], node expansions must be parallelized to keep Phi T comparable to Phi W and obtain acceptable performance. Note that by parallelizing node expansion, we divide it up into smaller atomic computation units and thus reduce the effective y (read N y as the computation time of each atomic ....
D.L. Miller and J.F. Pekny, "Results from a Parallel Branch and Bound Algorithm for Solving Large Asymmetric Traveling Salesman Problems," Operations Research Letters , Vol.8, pp.129-135, 1989.
Scalable Load Balancing Strategies for Parallel A* Algorithms - Dutt, Mahapatra (1994) (7 citations) (Correct)
.... on the design and evaluation of general load balancing strategies for parallel A algorithms that can be applied to any COP, we have employed a tree search formulation and a simple heuristic function for this purpose (as opposed to a graph search formulation [16] and a tighter heuristic function [18] that are possible for TSP) In Section 6.2, we show that while a different heuristic function can affect the cost wise distribution of nodes in OPEN , it will not have any impact on the load balancing capabilities of the QE strategy. Performance results in Section 8, where we test the efficacy of ....
D.L. Miller and J.F. Pekny, "Results from a Parallel Branch and Bound Algorithm for Solving Large Asymmetric Traveling Salesman Problems," Operations Research Letters, Vol.8, pp.129-135, 1989.
Parallel Best-First Branch-and-Bound in Discrete.. - Correa, Ferreira (1995) (3 citations) (Correct)
....theoretic model. Problem reference Integer linear programming shared memory [6] distributed memory [1] Knapsack distributed memory [9] Quadratic assignment (QAP) shared memory [54] distributed memory [32, 47] Scheduling distributed memory [39] Traveling salesperson (TSP) distributed memory [29, 41, 52, 55] Vertex cover (VCP) distributed memory [29, 38] Also, some industrial strength implementations, bearing some resemblance to commercial packages, begin to emerge: Problem reference Mixed integer programming distributed memory [12, 13] In the following, a set of distributed implementation is ....
.... 22 of subproblems decomposed. For reduced numbers of decomposed subproblems, the speedup tended to one, and deceleration speedup anomalies were detected. For instances whose the number of subproblems is sufficiently large, the speedups tended to p, and acceleration anomalies were verified [41, 50]. 6.2 Distributed data model The most important question to be addressed in the context of DDM is the dynamic workload sharing. Three choices must be done. The first choice consists of deciding between quantity or quality workload sharing. In the first case, the amount of work defines the ....
D. Miller and J. Pekny. Results from a parallel branch and bound algorithm for the asymmetric traveling salesman problem. Operations Research Letters, 8:129--135, June 1989.
An Object Oriented Approach to Generic Branch and Bound - de Bruin, Kindervater.. (1996) (Correct)
No context found.
D.L. Miller, J.F. Pekny (1989). Results from a parallel branch and bound algorithm for the asymmetric traveling salesman problem. Oper. Res. Lett. 8, 129--135.
Towards a Taxonomy of Parallel Branch and Bound Algorithms - Trienekens, de Bruin (1992) (4 citations) (Correct)
No context found.
J.F. Pekny, D.L. Miller (1989). Results from a parallel branch and bound algorithm for the asymmetric traveling salesman problem. OR Letters 8, 129-135.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC