A Novel TRUST-TECH Guided Branch-and-Bound Method for Nonlinear Integer Programming
نویسندگان
چکیده
منابع مشابه
More Branch-and-Bound Experiments in Convex Nonlinear Integer Programming
Branch-and-Bound (B&B) is perhaps the most fundamental algorithm for the global solution of convex Mixed-Integer Nonlinear Programming (MINLP) problems. It is well-known that carrying out branching in a non-simplistic manner can greatly enhance the practicality of B&B in the context of Mixed-Integer Linear Programming (MILP). No detailed study of branching has heretofore been carried out for MI...
متن کاملBranch and bound, integer, and non-integer programming
In this note we review the development of the first commercial branch and bound codes at CEIR/Scicon, with particular emphasis on those features not commonly emphasized today that is the use of branch and bound to handle discrete constructs, which, while often formally representable in terms of zero-one integer variables, can be handled more elegantly and effectively by applying branch and boun...
متن کاملA hybrid algorithm between branch-and-bound and outer approximation for Mixed Integer Nonlinear Programming
In this work, we present a new hybrid algorithm for convex Mixed Integer Nonlinear Programming combining branch-and-bound and outer approximation algorithms in an e ective and e cient way.
متن کاملA provable better Branch and Bound method for a nonconvex integer quadratic programming problem
This paper presents a Branch and Bound method for a nonconvex integer quadratic programming problem with a separable objective function over a bounded box. For this problem, a special branch method is constructed, which has a property that if a box has been partitioned into 2 sub-boxes, then at least one sub-box can be deleted. We analyze the complexity of the algorithm, and prove that it is be...
متن کاملBranch-and-bound for biobjective mixed-integer programming
We present a generic branch-and-bound method for finding all the Pareto solutions of a biobjective mixed integer program. Our main contribution is new algorithms for obtaining dual bounds at a node, for checking node fathoming, presolve and duality gap measurement. Our various procedures are implemented and empirically validated on instances from literature and a new set of hard instances. We a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Systems, Man, and Cybernetics: Systems
سال: 2015
ISSN: 2168-2216,2168-2232
DOI: 10.1109/tsmc.2015.2399475