z-logo
open-access-imgOpen Access
Node Selection Heuristics Using the Upper Bound in Interval Branch and Bound
Author(s) -
Bertrand Neveu,
Gilles Trombettoni,
Ignacio Araya
Publication year - 2014
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - English
Resource type - Conference proceedings
Subject(s) - upper and lower bounds , branch and bound , node (physics) , interval (graph theory) , selection (genetic algorithm) , heuristics , computer science , mathematical optimization , mathematics , algorithm , combinatorics , artificial intelligence , engineering , mathematical analysis , structural engineering

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