Branch and bound method

Chapter 7 - Supplement "Branch and bound method of solving integer programming problems", after completing this chapter, you should be able to: Use the branch and bound method to solve integer programming problems, use the enumeration method to solve 0–1 integer programming problems.

26p koxih_kothogmih6 22-09-2020 15 3   Download

In this paper we propose two algorithms based on branch and bound method and reduced interval techniques to compute all real zeros of a polynomial. Quadratic bounding functions are proposed which are better than the well known linear underestimator. Experimental result shows the efficiency of the two algorithms when facing ill-conditionned polynomials.

17p vinguyentuongdanh 19-12-2018 13 0   Download