A new class of relaxations for the network design problem based on lower planes, i.e., linear lower approximations of the objective function, is introduced. Such relaxations provide lower bounds much sharper than the bounds used so far in branch and bound algorithms for this problem.
No takes yet. Share an insight, caveat, or question.
Giorgio Gallo (1983) studied this question.
Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context: