z-logo
open-access-imgOpen Access
Interval Branch and Bound Algorithms dealing with Black-Box Constraints
Author(s) -
Julien Fontchastagner,
Frédéric Messine
Publication year - 2010
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - English
Resource type - Conference proceedings
Subject(s) - branch and bound , interval arithmetic , algorithm , interval (graph theory) , computer science , finite element method , code (set theory) , upper and lower bounds , mathematical optimization , black box , actuator , mathematics , engineering , artificial intelligence , set (abstract data type) , mathematical analysis , bounded function , structural engineering , programming language , combinatorics

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