Generating Cutting Planes for Mixed Integer Programming Problems in a Parallel Computing Environment

References

• Adams W. P., Sherali H. D. A tight linearization and an algorithm for zero-one quadratic programming problems. Management Sci. (1986) 32:1274–1290Link, Google Scholar
• Applegate D., Bixby R. E., Chvátal V., Cook W. Finding cuts in the TSP (a preliminary report). (1995) 95–105Technical report, DIMACSGoogle Scholar
• Applegate D., Bixby R. E., Chvátal V., Cook W. On the solution of traveling salesman problems. Documenta Math. J. der Deutschen Mathematiker-Vereinigung ICM III (1998) 645–656Google Scholar
• Balas E., Mangasarian O. L., Meyer R. R., Robinson S. M. Disjunctive programming: Cutting planes from logical conditions. Nonlinear Programming 2 (1975) (Academic Press, New York) 279–312Crossref, Google Scholar
• Balas E. Disjunctive programming. Ann. Discrete Math. (1979) 5:3–51Crossref, Google Scholar
• Balas E. A modified lift-and-project procedure. Math. Programming (1997) 79:19–32Crossref, Google Scholar
• Balas E., Ceria S., Cornuéjols G. A lift-and-project cutting plane algorithm for mixed 0/1 programs. Math. Programming (1993) 58:295–324Crossref, Google Scholar
• Balas E., Ceria S., Cornuéjols G. Mixed 0-1 programming by lift-and-project in a branch-and-cut framework. Management Sci. (1996) 42:1229–1246Link, Google Scholar
• Bixby R. E., Ceria S., McZeal C. M., Savelsbergh M. W. P. An updated mixed integer programming library: MIPLIB 3.0. Optima (1998) 58:12–15Google Scholar
• Bixby R. E., Cook W., Cox A., Lee E. K. Computational experience with parallel mixed integer programming in a distributed environment. Ann. Oper. Res. Parallel Optim. (1995) 90:19–43Crossref, Google Scholar
• Cannon T. L., Hoffman K. L. Large-scale 0/1 linear programming on distributed workstations. Ann. Oper. Res. (1990) 22:181–217Crossref, Google Scholar
• Carter J. B., Bennett J. K., Zwaenepoel W. Implementation and performance of Munin. Proc. 13th ACM, Sympos. on Operating Systems Principles (1991) (Pacific Grove, CA)152–164Crossref, Google Scholar
• Ceria S., Pataki G., Bixby R. E., Andrew Boyd E., Rios-Mercado Roger Z. Solving integer and disjunctive programs by lift and project. Proc. 6th Internat. IPCO Conf. Lecture Notes in Computer Science (1998) 1412(Springer, Berlin, Germany) 271–283Integer programming and combinatorial optimizationCrossref, Google Scholar
• Crowder H., Johnson E. L., Padberg M. Solving large-scale zero-one linear programming problems. Oper. Res. (1983) 31:803–834Link, Google Scholar
• Eckstein J. Parallel branch-and-bound algorithm for general integer programming on the CM-5. SIAM J. Optim. (1994) 4:794–814Crossref, Google Scholar
• Gale D.The Theory of Linear Economic Models (1960) (McGraw-Hill Book Company, New York) Google Scholar
• Gendron B., Crainic T. G. Parallel branch-and-bound algorithms: Survey and synthesis. Oper. Res. (1994) 42:1042–1066Link, Google Scholar
• Gharachorloo K., Lenoski D., Laudon J., Gibbons P., Gupta A., Hennessy J. Memory consistency and event ordering in scalable shared-memory multiprocessors. Proc. 17th Ann. Internat. Sympos. on Comput. Architecture. (1990) 15–26SIGARCH90Google Scholar
• Gomory R. E. Outline of an algorithm for integer solutions to linear programs. Bull. Amer. Math. Soc. (1958) 64:275–278Crossref, Google Scholar
• Gomory R. E. An algorithm for the mixed integer problem. (1960a) . Technical report RM-2597. The Rand Corporation, Santa Monica, CAGoogle Scholar
• Gomory R. E., Bellman R. E., Hall M. Solving linear programs in integers. Combinatorial Analysis (1960b) (American Mathematical Society, Providence, RI) 211–216Crossref, Google Scholar
• Gomory R. E., Graves R., Wolfe P. An algorithm for integer solutions to linear programs. Recent Advances in Mathematical Programming (1963) (McGraw-Hill, New York) 269–302Google Scholar
• Keleher P., Cox A., Zwaenepoel W. Lazy release consistency for software distributed shared memory. Proc. 19th Ann. Internat. Sympos. Comput. Architecture (1992) (ACM Press, Gold Coast, Australia) 13–21Google Scholar
• Lee E. K. Computational experience with a general purpose mixed 0/1 integer programming solver (MIPSOL). (1997) . Technical report, School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GAGoogle Scholar
• Lee E. K., Fox T., Crocker I. Optimization of radiosurgery treatment planning via mixed integer programming. Medical Phys. (1998) 27:995–1004Crossref, Google Scholar
• Lee E. K., Fox T., Crocker I. Integer programming applied to intensity-modulated radiation therapy treatment planning. Ann. Oper. Res. (2003) 119:165–181Crossref, Google Scholar
• Li K., Hudak P. Memory coherence in shared virtual memory systems. ACM Trans. Comput. Systems (1989) 7:321–359Crossref, Google Scholar
• Linderoth J., Permulla K., Savelsbergh M. W. P. PARINO—A system for parallel mixed integer optimization. (1998) . Technical report, Georgia Institute of Technology, Atlanta, GAGoogle Scholar
• Lovász L., Schrijver A. Cones of matrices and set functions and 0-1 optimization. SIAM J. Optim. (1991) 1:166–190Crossref, Google Scholar
• Mangasarian O. L.Nonlinear Programming (1959) (McGraw-Hill Book Company, New York) Google Scholar
• Nemhauser G. L., Wolsey L. A.Integer and Combinatorial Optimization (1988) (Wiley, New York) Crossref, Google Scholar
• Sherali H. D., Adams W. P. A hierarchy of relaxations between the continuous and convex hull representation for zero-one programming problems. SIAM J. Discrete Math. (1990) 3:411–430Crossref, Google Scholar
• TreadMarksConcurrent Programming with TreadMarks (1994) . User Manual, Parallel Tools, L.L.C., Houston, TXGoogle Scholar