New LP formulations and recursive methods compute set tolerances in combinatorial optimization, with exact formulas for small sets and specific results including bounds and formulas for the minimum spanning tree problem.
John Wiley & Sons, Ltd (1997)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Computation of Set Tolerances with Applications to the Minimum Spanning Tree Problem
New LP formulations and recursive methods compute set tolerances in combinatorial optimization, with exact formulas for small sets and specific results including bounds and formulas for the minimum spanning tree problem.