z-logo
open-access-imgOpen Access
Computing real zeros of a polynomial by branch and bound and branch and reduce algorithms
Author(s) -
Thi Le,
Mohand Ouanès,
Ahmed Zidna
Publication year - 2014
Publication title -
yugoslav journal of operations research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.221
H-Index - 21
eISSN - 1820-743X
pISSN - 0354-0243
DOI - 10.2298/yjor120620004l
Subject(s) - bounding overwatch , branch and bound , mathematics , algorithm , polynomial , interval arithmetic , interval (graph theory) , branch and cut , quadratic equation , discrete mathematics , computer science , combinatorics , linear programming , artificial intelligence , mathematical analysis , geometry , bounded function
International audienc

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom