Control strategies for parallel mixed integer branch and bound

@inproceedings{Eckstein1994ControlSF,
  title={Control strategies for parallel mixed integer branch and bound},
  author={Jonathan Eckstein},
  booktitle={SC},
  year={1994}
}
Mixed integer programs are numerical optimization problems that arise frequently in operations research, particularly in industrial logistics and tactical planning. Their classical solution method is a tree-search branch and bound algorithm in which each tree node represents a linear program. This paper describes an implementation of general mixed integer branch and bound that runs on the CM5 family of parallel processors. This code allows varying amounts of centralization, and combines the… CONTINUE READING
Highly Cited
This paper has 20 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 12 extracted citations

Similar Papers

Loading similar papers…