scientific article
From MaRDI portal
Publication:2768018
zbMath0989.90130MaRDI QIDQ2768018
Jonathan Eckstein, William E. Hart, Cynthia A. Phillips
Publication date: 9 April 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Parallel numerical computation (65Y05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (7)
Parallelization of the FICO Xpress-Optimizer ⋮ PEBBL: an object-oriented framework for scalable parallel branch and bound ⋮ FiberSCIP—A Shared Memory Parallelization of SCIP ⋮ Performance analysis of branch-and-bound skeletons ⋮ Unnamed Item ⋮ A parallel branch-and-bound algorithm to compute a tighter tardiness bound for preemptive global EDF ⋮ A parallel optimisation approach for the realisation problem in intensity modulated radiotherapy treatment planning
Uses Software
This page was built for publication: