Advertisement

Annals of Operations Research

, Volume 90, Issue 0, pp 19–43 | Cite as

Computational experience with parallel mixed integerprogramming in a distributed environment

  • R.E. Bixby
  • W. Cook
  • A. Cox
  • E.K. Lee
Article

Abstract

Numerical experiments for a parallel implementation of a branch‐and‐bound mixed 0/1integer programming code are presented. Among its features, the code includes cutting‐planegeneration at the root node, and employs a new branching‐variable selection rulewithin the search tree. The code runs on a loosely‐coupled cluster of workstations usingTreadMarks as the parallel software platform. Numerical tests were performed on all mixed0/1 MIPLIB instances as well as two previously unsolved MIP instances, one arising fromtelecommunication networks and the other a multicommodity flow problem.

Keywords

Numerical Experiment Root Node Computational Experience Numerical Test Search Tree 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    D. Applegate, R.E. Bixby, V. Chvátal and W. Cook, Finding cuts in the TSP (A preliminary report), DIMACS Technical Report 95-05, March, 1995.Google Scholar
  2. [2]
    E. Balas, Disjunctive programming: Cutting planes from logical conditions, in: Nonlinear Programming 2, eds. O.L. Mangasarian et al., Academic Press, 1975, pp. 279-312.Google Scholar
  3. [3]
    E. Balas, S. Ceria and G. Cornuéjols, A lift-and-project cutting plane algorithm for mixed 0/1 programs, Mathematical Programming 58(1993)295-324.Google Scholar
  4. [4]
    E. Balas and E. Zemel, Facets of the knapsack polytope from minimal covers, SIAM Journal of Applied Mathematics 34(1978)119-148.Google Scholar
  5. [5]
    D. Bienstock and O. Günlük, Computational experience with a difficult mixed-integer multicommodity flow problem, Mathematical Programming 68(1995)213-237.Google Scholar
  6. [6]
    R.E. Bixby, E.A. Boyd, S.S. Dadmehr and R.R. Indovina, The MIPLIB mixed integer programming library, COAL Bulletin 22(1993).Google Scholar
  7. [7]
    R.E. Bixby and E.K. Lee, Solving a truck dispatching scheduling problem using branch-and-cut, TR93-37, Department of Computational and Applied Mathematics, Rice University, 1993.Google Scholar
  8. [8]
    R.E. Bixby and E.K. Lee, Solving a truck dispatching scheduling problem using branch-and-cut, Operations Research 46(1998)355-367.Google Scholar
  9. [9]
    A.L. Brearley, G. Mitre and H.P. Williams, Analysis of mathematical programming problems prior to applying the simplex method, Mathematical Programming 5(1975)54-83.Google Scholar
  10. [10]
    J.B. Carter and J.K. Bennett and W. Zwaenepoel, Implementation and performance of Munin, Proceedings of the 13th ACM Symposium on Operating Systems Principles, 1991, pp. 152-164.Google Scholar
  11. [11]
    T.L. Cannon and K.L. Hoffman, Large-scaled 0/1 linear programming on distributed workstations, Annals of Operations Research 22(1990)181-217.Google Scholar
  12. [12]
    H. Crowder, E.L. Johnson and M. Padberg, Solving large-scale zero-one linear programming problems, Operations Research 31(1983)803-834.Google Scholar
  13. [13]
    J. Eckstein, Parallel branch-and-bound algorithm for general integer programming on the CM-5, SIAM Journal on Optimization 4(1994)794-814.Google Scholar
  14. [14]
    J.J. Forrest and D. Goldfarb, Steepest-edge simplex algorithms for linear programming, Mathematical Programming 57(1992)341-374.Google Scholar
  15. [15]
    B. Gendron and T.G. Crainic, Parallel branch-and-bound algorithms: Survey and synthesis, Operations Research 42(1994)1042-1066.Google Scholar
  16. [16]
    K. Gharachorloo, D. Lenoski, J. Laudon, P. Gibbons, A. Gupta and J. Hennessy, Memory consistency and event ordering in scalable shared-memory multiprocessors, Proceedings of the 17th Annual International Symposium on Computer Architecture, SIGARCH90, 1990, pp. 15-26.Google Scholar
  17. [17]
    K.L. Hoffman and M. Padberg, Solving airline crew-scheduling problems by branch-and-cut, Management Science 39(1993)657-682.Google Scholar
  18. [18]
    P. Keleher, A. Cox and W. Zwaenepoel, Lazy release consistency for software distributed shared memory, Proceedings of the 19th Annual International Symposium on Computer Architecture, 1992, pp. 13-21.Google Scholar
  19. [19]
    P. Keleher, A. Cox, S. Dwarkadas and W. Zwaenepoel, TreadMarks: Distributed memory on standard workstations and operating systems, Proceedings of the 1994 Winter Usenix Conference, 1994, pp. 115-131.Google Scholar
  20. [20]
    K. Li and P. Hudak, Memory coherence in shared virtual memory systems, ACM Transactions on Computer Systems 4(1989)229-239.Google Scholar
  21. [21]
    L.A. Oley and R.J. Sjoquist, Automatic reformulation of mixed and pure integer models to reduce solution time in APEX IV, SIGMAP Bulletin 32(1983).Google Scholar
  22. [22]
    L.A. Wolsey, Faces for a linear inequality in 0-1 variables, Mathematical Programming 8(1975)165-178.Google Scholar
  23. [23]
    E. Zemel, Easily computable facets of the knapsack polytope, Mathematics of Operations Research 14(1989)760-764.Google Scholar

Copyright information

© Kluwer Academic Publishers 1999

Authors and Affiliations

  • R.E. Bixby
  • W. Cook
  • A. Cox
  • E.K. Lee

There are no affiliations available

Personalised recommendations