A two-stage parallel branch and bound algorithm for mixed integer programs

DOI10.1093/imaman/15.3.227zbMath1070.90077OpenAlexW2112758985MaRDI QIDQ4659864

Gautam Mitra, V. Nwana, Kenneth Darby-Dowman

Publication date: 21 March 2005

Published in: IMA Journal of Management Mathematics (Search for Journal in Brave)

Full work available at URL: http://bura.brunel.ac.uk/handle/2438/700

zbMATH Keywords

heuristicsinteger programmingbranch-and-boundparallel computingcomputational behaviour

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Using diversification, communication and parallelism to solve mixed-integer linear programs, Parallelization of the FICO Xpress-Optimizer, FiberSCIP—A Shared Memory Parallelization of SCIP

Uses Software

• MIPLIB