ScholarLens Back to search
2019•Current Journal of Applied Science and TechnologyOpen access

A Note on Branch and Bound Algorithm for Integer Linear Programming

Syed Inayatullah, Wajiha Riaz, Hafsa Athar Jafree, Tanveer Ahmed Siddiqi, Muhammad Imtiaz, Saba Naz, Syed Ahmad Hassan

Open full text 2 citations

Abstract

In branch and bound algorithm for integer linear programming the usual approach is incorporating dual simplex method to achieve feasibility for each sub-problem. Although one can also employ the phase 1 simplex method but the simplicity and easy implementation of the dual simplex method bounds the users to use it. In this paper a new technique for handling sub-problems in branch and bound method has been presented, which is an efficient alternative of dual simplex method.

About this research paper

What this paper is about

In branch and bound algorithm for integer linear programming the usual approach is incorporating dual simplex method to achieve feasibility for each sub-problem. Although one can also employ the phase 1 simplex method but the simplicity and easy implementation of the dual simplex method bounds the users to use it. In this paper a new technique for handling sub-problems in branch and bound method has been presented, which is an efficient alternative of dual simplex method.

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

In branch and bound algorithm for integer linear programming the usual approach is incorporating dual simplex method to achieve feasibility for each sub-problem. Although one can also employ the phase 1 simplex method but the simplicity and easy implementation of the dual simplex method bounds the users to use it. In this paper a new technique for handling sub-problems in branch and bound method has been presented, which is an efficient alternative of dual simplex method.

Key concepts: Simplex algorithm, Branch and cut, Branch and bound, Integer programming, Linear programming, Branch and price, Simplex, Revised simplex method

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
A Note on Branch and Bound Algorithm for Integer Linear Programming — Research Paper | ScholarLens