A branch-and-cut algorithm for Mixed-Integer Bilinear Programming
Copyright policy )A branch-and-cut algorithm for Mixed-Integer Bilinear Programming
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mixed integer programming, mixed-integer quadratic programming, branch-and-cut algorithms, Polyhedral combinatorics, branch-and-bound, branch-and-cut, bilinear programming, combinatorial optimization, intersection cuts, Quadratic programming, Combinatorial optimization; Mixed-integer quadratic programming; Bilinear programming; Branch-and-cut algorithms; Intersection cuts
Mixed integer programming, mixed-integer quadratic programming, branch-and-cut algorithms, Polyhedral combinatorics, branch-and-bound, branch-and-cut, bilinear programming, combinatorial optimization, intersection cuts, Quadratic programming, Combinatorial optimization; Mixed-integer quadratic programming; Bilinear programming; Branch-and-cut algorithms; Intersection cuts
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).28 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.Top 10%
Citations provided by BIP!Popularity provided by BIP!