A capacity expansion problem with budget constraint and bottleneck limitation
DOI10.1016/S0252-9602(17)30430-7zbMath1016.90025OpenAlexW2784060764MaRDI QIDQ5959689
Publication date: 20 March 2002
Published in: Acta Mathematica Scientia. Series B. (English Edition) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0252-9602(17)30430-7
polynomial complexityminimum spanning treebottleneck spanning treebudget constraintcapacity expansion
Numerical mathematical programming methods (65K05) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Abstract computational complexity for mathematical programming problems (90C60) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Combinatorial optimization (90C27) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)
Related Items