A new modified deflected subgradient method
A new deflected subgradient algorithm is presented for computing a tighter lower bound of the dual problem. These bounds may be useful in nodes evaluation in a Branch and Bound algorithm to find the optimal solution of large-scale integer linear programming problems. The deflected direction search u...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Elsevier
2018-10-01
|
| Series: | Journal of King Saud University: Science |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S1018364717304081 |