Search
Now showing items 1-1 of 1
Recovery of primal solutions from dual subgradient methods for mixed binary linear programming; a branch-and-bound approach
(2015-10-06)
The main objective of this thesis is to implement and evaluate a Lagrangian
heuristic and a branch-and-bound algorithm for solving a class of mathematical
optimization problems called mixed binary linear programs. ...