Graver basis
In applied mathematics, Graver bases enable iterative solutions of linear and various nonlinear integer programming problems in polynomial time. They were introduced by . Their connection to the theory of Gröbner bases was discussed by Bernd Sturmfels. The algorithmic theory of Graver bases and its application to integer programming is described by .
Wikipage disambiguates
Wikipage redirect
Link from a Wikipage to another Wikipage
primaryTopic
Graver basis
In applied mathematics, Graver bases enable iterative solutions of linear and various nonlinear integer programming problems in polynomial time. They were introduced by . Their connection to the theory of Gröbner bases was discussed by Bernd Sturmfels. The algorithmic theory of Graver bases and its application to integer programming is described by .
has abstract
In applied mathematics, Graver ...... programming is described by .
@en
Wikipage page ID
34,740,103
page length (characters) of wiki page
Wikipage revision ID
987,005,534
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
subject
comment
In applied mathematics, Graver ...... programming is described by .
@en
label
Graver basis
@en