A Primal-Dual Approach for Large Scale Integer Problems

Alpár Jüttner, Péter Madarasi


This paper presents a refined approach to using column generation to solve specific type of large integer problems. A primal-dual approach is presented to solve the Restricted Master problem belonging to the original optimization task. Firstly, this approach allows a faster convergence to the optimum of the LP relaxation of the problem. Secondly, the existence of both an upper and lower bound of the LP optimum at each iteration allows a faster searching of the Branch-and-Bound tree. To achieve this an early termination approach is presented. The technique is demonstrated on the Generalized Assignment problem and Parallel Machine Scheduling problem as two reference applications.

Bibtex entry:

AUTHOR = {Jüttner, Alp{\'a}r and Madarasi, P{\'e}ter},
TITLE = {A Primal-Dual Approach for Large Scale Integer Problems},
NOTE= {{\tt}},
INSTITUTION = {Egerv{\'a}ry Research Group, Budapest},
YEAR = {2018},
NUMBER = {TR-2018-09}

Last modification: 29.12.2020. Please email your comments to Tamás Király!