scientific article; zbMATH DE number 1206103

MaRDI QIDQ4209154zbMATH OpenFDO

Authors Jonathan Eckstein

Publication date 14 October 1998

zbMATH Keywords

mixed integer programmingparallel branch-and-bound methods

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Parallel numerical computation (65Y05) Mixed integer programming (90C11)

Recommendations

• Parallel Branch-and-Bound Algorithms for General Mixed Integer Programming on the CM-5
• A two-stage parallel branch and bound algorithm for mixed integer programs
• Computational experience with parallel mixed integer programming in a distributed environment
• A parallel integer linear programming algorithm

Cited in

(23)

• A parallel integer linear programming algorithm
• Supernode processing of mixed-integer models
• Using diversification, communication and parallelism to solve mixed-integer linear programs
• On parallel branch and bound frameworks for global optimization
• Computational experience with parallel mixed integer programming in a distributed environment
• Could we use a million cores to solve an integer program?
• Nutmeg: a MIP and CP hybrid solver using branch-and-check
• Experience of multilevel parallelizing of the branch and bound method in discrete optimization problems
• Solving hard mixed-integer programming problems with Xpress-MP: a MIPLIB 2003 case study
• Multiobjective Integer Programming: Synergistic Parallel Approaches
• Solving a mixed integer program by fathoming dual programs
• scientific article; zbMATH DE number 151869 (Why is no real title available?)
• scientific article; zbMATH DE number 1206115 (Why is no real title available?)
• Parallel Branch-and-Bound Algorithms for General Mixed Integer Programming on the CM-5
• How Much Communication Does Parallel Branch and Bound Need?
• Distributed solving of mixed-integer programs with GLPK and Thrift
• A two-stage parallel branch and bound algorithm for mixed integer programs
• Mixed integer programming: analyzing 12 years of progress
• A Parallel Macro Partitioning Framework for Solving Mixed Integer Programs
• \(oo{\mathcal{MILP}}\) -- a C++ callable object-oriented library and the implementation of its parallel version using CORBA
• A co-operative parallel heuristic for mixed zero--one linear programming: Combining simulated annealing with branch and bound
• Parallel partitioning method (PPM): A new exact method to solve bi-objective problems
• PEBBL: an object-oriented framework for scalable parallel branch and bound

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4209154)