A new bounding technique in branch-and-bound algorithms for mixed integer programming

zbMATH Open0896.90152MaRDI QIDQ1384440FDOQ1384440

Authors: D. Massart 

Publication date: 12 July 1998

Published in: Acta Mathematica Vietnamica (Search for Journal in Brave)

Recommendations

• An improved branch and bound algorithm for mixed integer nonlinear programs
• A branch and bound method for the solution of multiparametric mixed integer linear programming problems
• An implicit branch-and-bound algorithm for mixed-integer linear programming
• A new branching rule for the branch and bound algorithms for solving nonlinear integer programming problems
• A branch-and-bound algorithm for 0-1 parametric mixed integer programming
• A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization
• A hybrid branch-and-bound approach for exact rational mixed-integer programming
• A new branch and bound method for integer quadratic programming problems
• Technical Note—An Improved Branch-and-Bound Method for Integer Programming

zbMATH Keywords

branch-and-bound

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Cited In (4)

• An improved branch and bound algorithm for mixed integer nonlinear programs
• A new node selection strategy in the branch-and-bound procedure
• An implicit branch-and-bound algorithm for mixed-integer linear programming
• A new branching rule for the branch and bound algorithms for solving nonlinear integer programming problems

This page was built for publication: A new bounding technique in branch-and-bound algorithms for mixed integer programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1384440)