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
Current Journal of Applied Science and Technology · pp. 1–6 · Published 24 Apr 2019
10.9734/cjast/2019/v34i630155Abstract
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.
Cited by 1
Ievgeniia Misiura, Serhii Misiura, Natalia Smetankina · Bulletin of the National Technical University «KhPI» Series: Dynamics and Strength of Machines · 2024
Related research
- An Application of Assignment Problem in Agriculture Using R — shares topic coverage
- Bi-Level Multi-Objective Large Scale Integer Quadratic Programming Problem with Symmetric Trapezoidal Fuzzy Numbers in the Objective Functions — shares topic coverage
- An Optimal Model and Production Planning in Upholstery by Linear Integer Programming — shares topic coverage
- Stability of Multiple Knapsack Problems with Interval Capacities — shares topic coverage
- Intuitionistic Fuzzy Assignment Problem: An Application in Agriculture — shares topic coverage
Article metrics
Real usage data collected on this platform.
0
Page views
0
PDF downloads
0
Outbound clicks
1
Citations
Views by country
Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".
No views recorded yet.
Traffic sources
Referring site, by host.
No traffic recorded yet.
Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.