D. L. Miller and J. F. Pekny. The role of performance metrics for parallel mathematical programming algorithms. ORSA Journal on Computing, 5(1), 1993. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
State-of-the-Art in Parallel Search Techniques for Discrete.. - Grama, Kumar (Correct)
....with 100 integer variables were considered challenging, today, many problems with up to 1000 integer variables can be solved on workstation class machines using branch and cut methods. Largest known instances of TSPs and QAPs have been solved using branch and bound with powerful heuristics [3, 35]. The presence of effective heuristics may prune the search space considerably. For example, when Padberg and Rinaldi introduced the branch and cut algorithm in 1987, they used it to solve a 532 city TSP, which was the largest TSP solved optimally at that time. Subsequent improvements to the ....
....improvements to the method led to the solution of a a 2,392 city problem [36] More recently, using cutting planes, problems with over 7,000 cities have been solved [18] on serial machines. However, for many problems of interest, the re10 duced search space still requires the use of parallelism [3, 35, 44, 31]. Use of powerful heuristics combined with effective parallel processing has enabled the solution of extremely large problems [35] For example, QAP problems from the Nugent and Eschermann test suites with up to 4:8 Theta 10 10 nodes (Nugent22 with Gilmore Lawler bound) were solved on a NEC ....
[Article contains additional citation context not shown here]
D. L. Miller and J. F. Pekny. The role of performance metrics for parallel mathematical programming algorithms. ORSA Journal on Computing, 5(1), 1993.
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