Improved branching disjunctions for branch-and-bound: an analytic center approach

DOI10.1016/j.ejor.2015.05.066zbMath1346.90611OpenAlexW2148408666MaRDI QIDQ319920

Joe Naoum-Sawaya, Samir Elhedhli

Publication date: 6 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2015.05.066

zbMATH Keywords

integer programmingbranch-and-boundinterior-point methodsanalytic centergeneralized branching

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Linear programming (90C05) Interior-point methods (90C51)

Related Items (2)

Scalable branching on dual decomposition of stochastic mixed-integer programming problems ⋮ A study of lattice reformulations for integer programming

Cites Work

• Unnamed Item
• Unnamed Item
• Using the primal-dual interior point algorithm within the branch-price-and-cut method
• Achieving MILP feasibility quickly using general disjunctions
• Recursive central rounding for mixed integer programs
• Branching on general disjunctions
• An interior point cutting plane heuristic for mixed integer programming
• Improved strategies for branching on general disjunctions
• Improving the efficiency of the branch and bound algorithm for integer programming based on ``flatness information
• The integration of an interior-point cutting plane method within a branch-and-price algorithm
• New developments in the primal-dual column generation technique
• An interior-point Benders based branch-and-cut algorithm for mixed integer programs
• Integer Programming with a Fixed Number of Variables
• On the Complexity of Selecting Disjunctions in Integer Programming
• Decomposition and Nondifferentiable Optimization with the Projective Algorithm
• An Implementation of the Generalized Basis Reduction Algorithm for Integer Programming
• A Nonlinear Analytic Center Cutting Plane Method for a Class of Convex Programming Problems
• On constrained optimization by adjoint based quasi-Newton methods
• A Computational Study of Search Strategies for Mixed Integer Programming
• An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
• Incorporating Condition Measures in the Context of Combinatorial Optimization
• Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
• Experimental results on using general disjunctions in branch-and-bound for general-integer linear programming

This page was built for publication: Improved branching disjunctions for branch-and-bound: an analytic center approach