Answers are grounded in this paper and cite their sources.
A new integer programming dual problem is constructed from a reformulation of the integer programming problem. Properties of this integer programming dual problem are developed and it is shown that strong integer programming cuts and surrogate constraints can be derived from optimal dual solutions. A primal–dual ascent algorithm for solution of the integer programming dual problem is presented, and the use of this algorithm in branch-and-bound is explained.
No takes yet. Share an insight, caveat, or question.
Fisher et al. (1974) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: