Solving linear bottleneck assignment problems via strong spanning trees.
Ronald D. ArmstrongZhiying JinPublished in: Oper. Res. Lett. (1992)
Keyphrases
- spanning tree
- edge disjoint
- convex quadratic programming
- minimum spanning trees
- quadratic programming
- set of linear equations
- minimum cost
- algebraic equations
- minimum spanning tree
- linear systems
- nonlinear programming
- linear constraints
- combinatorial optimization
- closed form
- depth first search
- lower bound
- linear model
- weighted graph