Wiley Encyclopedia of Operations Research and Management Science 2011
DOI: 10.1002/9780470400531.eorms0677
|View full text |Cite
|
Sign up to set email alerts
|

Polynomial Time Primal Integer Programming via Graver Bases

Abstract: We describe recent developments in primal methods for integer programming which lead to the polynomial time solution of new broad classes of integer programming problems with linear and various nonlinear objective functions.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 19 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?