• Corpus ID: 14355350

Using an interior point method in a branch and bound algorithm for integer programming July

  title={Using an interior point method in a branch and bound algorithm for integer programming July},
  author={Brian Borchers},
This paper describes an experimental code that has been developed to solve zero one mixed integer linear programs The experimental code uses a primal dual interior point method to solve the linear programming subproblems that arise in the solution of mixed integer linear programs by the branch and bound method Computational results for a number of test problems are provided 

Figures and Tables from this paper

AD-A 256 041 " ( Using an interior point cutting plane method to solve integer programming problems-Final report of research supported
There were several accomplishments of this research, both theoretical and computational. In joint work with Todd, we presented a cutting plane primal projective interior point method which we applied
Interior Point Cutting Plane Methods in Integer Programming
This thesis presents novel approaches that use interior point concepts in solving mixed integer programs. Particularly, we use the analytic center cutting plane method to improve three of the main
Integer Programming for Telecommunications
  • Eva K. Lee, D. Lewis
  • Business, Computer Science
    Handbook of Optimization in Telecommunications
  • 2006
Lagrangian relaxation in the context of solving specific telecommunication instances is analyzed as an alternative relaxation for use within the branch-and-bound tree search environment.
Branch-and-bound Methods for Integer Programming, Branch-and-bound
  • Mathematics
Overview. An integer programming problem (IP) is an optimization problem in which some or all of the variables are restricted to take on only integer values. The exposition presented here will focus
SICOpt: Solution Approach for Nonlinear Integer Stochastic Programming Problems
A novel solution approach for the class of two-stage nonlinear integer stochastic programming models characterized by large scale dimensions, characterized by good computational efficiency, without any loss in terms of effectiveness is proposed.
A hybrid approach combining interior-point and branch-and-bound methods applied to the problem of sugar cane waste
The mathematical results confirm that the proposed hybrid method for solving the multi-objective model related to the minimisation of sugar cane waste collection costs and/or the maximisation of produced energy by this waste presents good computational performance and reliable solutions.
Empirical Analysis of Algorithms for Block-Angular Linear Programs
A hybrid algorithm combining ACCPM and DW is devised, which are the counterparts of IPM and simplex in the decomposition framework, to take the advantages of both: the quick convergence rate of IPM-based methods, as well as the accuracy of simplex-based algorithms.
A simplex grey wolf optimizer for solving integer programming and minimax problems
The proposed SGWO algorithm is a new hybrid grey wolf optimizer (GWO) algorithm with simplex Nelder-Mead method that is able to solve integer programming and minimax problems in reasonable time.
Theoretical and computational issues for improving the performance of linear optimization methods
This thesis proposes theoretical and computational developments to improve the performance of important linear optimization methods, including simplex type methods, interior point methods, the column generation technique and the branch-and-price method.
A simplex social spider algorithm for solving integer programming and minimax problems
The proposed algorithm is a Simplex Social Spider optimization (SSSO) algorithm that combines the social spider algorithm with its powerful capability of performing exploration, exploitation, and the Nelder-Mead method in order to refine the best obtained solution from the standard socialSpider algorithm.


An Implementation of a Primal-Dual Interior Point Method for Linear Programming
Preliminary computational results indicate that this implementation compares favorably with a comparable implementation of a dual affine interior point method, and with MINOS 5.0, a state-of-the-art implementation of the simplex method.
Implementing Interior Point Linear Programming Methods in the Optimization Subroutine Library
Internal point (barrier) methods for linear programming within the framework of the IBM Optimization Subroutine Library can benefit greatly from use of vector architectures on the IBM 3090™ series computers and “super-scalar“ processing on the RISC System/6000™ series.
An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem
This paper describes an efficient solution procedure for the warehouse location problem in which limitations on the amount of goods which can be handled are also imposed. The proposed
A Study of Indicators for Identifying Zero Variables in Interior-Point Methods
This work first gives a formal presentation of the notion of indicators for identifying zero variables, and then studies various indicators proposed in the literature for use with interior-point methods for linear programming.
Yale sparse matrix package I: The symmetric codes
This report presents a package of efficient, reliable, well-documented, and portable FORTRAN subroutines for solving NxN system of linear equations M x = b, where the coefficient matrix M is large, sparse, and nonsymmetric.
Integer Programming Algorithms: A Framework and State-of-the-Art Survey
A unifying framework is developed to facilitate the understanding of most known computational approaches to integer programming. A number of currently operational algorithms are related to this
An Im- plementation of a Primal-Dual Interior Method for linear Programming, ORSA
  • Journal on Computing
  • 1989