Parallel Branch-and-Bound Algorithms for General Mixed Integer Programming on the CM-5

DOI10.1137/0804046zbMath0819.90063OpenAlexW2001619061MaRDI QIDQ4321311

Jonathan Eckstein

Publication date: 5 September 1995

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0804046

zbMATH Keywords

branch-and-boundparallel solutiongeneral mixed integer programs

Mathematics Subject Classification ID

Mixed integer programming (90C11) Computing methodologies and applications (68U99) Parallel numerical computation (65Y05)

Related Items

Algorithms and Software for Convex Mixed Integer Nonlinear Programs, Random allocation of jobs with weights and precedence, Application of a hybrid genetic algorithm to airline crew scheduling, Parallelization of the FICO Xpress-Optimizer, A theoretical and computational analysis of full strong-branching, A branch-and-bound algorithm for instrumental variable quantile regression, PEBBL: an object-oriented framework for scalable parallel branch and bound, FiberSCIP—A Shared Memory Parallelization of SCIP, Using high performance computing for unrelated parallel machine scheduling with sequence-dependent setup times: development and computational evaluation of a parallel branch-and-price algorithm, An alternating direction method of multipliers with a worst-case $O(1/n^2)$ convergence rate, A computational study of parametric tabu search for 0-1 mixed integer programs, Active-constraint variable ordering for faster feasibility of mixed integer linear programs, Computational study of a family of mixed-integer quadratic programming problems, Dynamic load balancing in computational mechanics, Branch-and-refine for solving time-expanded MILP formulations

Uses Software

• MIPLIB
• CPLEX