Strongly polynomial time algorithms for certain concave minimization problems on networks
Copyright policy )Strongly polynomial time algorithms for certain concave minimization problems on networks
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
- Institute of Mathematics Viet Nam
single source uncapacitated network, production- transportation problem, minimum concave cost flow problem, parametric method, Sensitivity, stability, parametric optimization, strongly polynomial algorithm, Deterministic network models in operations research, Production models, Abstract computational complexity for mathematical programming problems
single source uncapacitated network, production- transportation problem, minimum concave cost flow problem, parametric method, Sensitivity, stability, parametric optimization, strongly polynomial algorithm, Deterministic network models in operations research, Production models, Abstract computational complexity for mathematical programming problems
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).17 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!