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

DOI10.1016/J.EJOR.2015.05.066zbMATH Open1346.90611OpenAlexW2148408666MaRDI QIDQ319920FDOQ319920

Authors: Samir Elhedhli, Joe Naoum-Sawaya 

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

Recommendations

• Improved strategies for branching on general disjunctions
• Branching on general disjunctions
• Experimental results on using general disjunctions in branch-and-bound for general-integer linear programming
• Branching on split disjunctions
• Achieving MILP feasibility quickly using general disjunctions

zbMATH Keywords

integer programminginterior-point methodsbranch-and-boundanalytic centergeneralized branching

Mathematics Subject Classification ID

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

Cites Work

• A Computational Study of Search Strategies for Mixed Integer Programming
• New developments in the primal-dual column generation technique
• Integer Programming with a Fixed Number of Variables
• Using the primal-dual interior point algorithm within the branch-price-and-cut method
• Decomposition and Nondifferentiable Optimization with the Projective Algorithm
• On constrained optimization by adjoint based quasi-Newton methods
• Title not available (Why is that?)
• The integration of an interior-point cutting plane method within a branch-and-price algorithm
• An interior-point Benders based branch-and-cut algorithm for mixed integer programs
• On the complexity of selecting disjunctions in integer programming
• Achieving MILP feasibility quickly using general disjunctions
• Recursive central rounding for mixed integer programs
• Title not available (Why is that?)
• 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
• An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
• Branching on general disjunctions
• 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
• 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

Cited In (4)

• Scalable branching on dual decomposition of stochastic mixed-integer programming problems
• A study of lattice reformulations for integer programming
• Branching on general disjunctions
• 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

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