About strongly polynomial time algorithms for quadratic optimization over submodular constraints
Copyright policy )About strongly polynomial time algorithms for quadratic optimization over submodular constraints
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
- University of California, Berkeley United States
parametric maximum flow, Linear programming, Special polytopes (linear programming, centrally symmetric, etc.), Integer programming, strongly polynomial algorithms, Quadratic programming, Programming involving graphs or networks, convex separable quadratic minimization over submodular constraints, Abstract computational complexity for mathematical programming problems, lexicographically optimal flow, Kuhn-Tucker conditions
parametric maximum flow, Linear programming, Special polytopes (linear programming, centrally symmetric, etc.), Integer programming, strongly polynomial algorithms, Quadratic programming, Programming involving graphs or networks, convex separable quadratic minimization over submodular constraints, Abstract computational complexity for mathematical programming problems, lexicographically optimal flow, Kuhn-Tucker conditions
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).33 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.Top 10% 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!