Polynomial Time Primal Integer Programming via Graver Bases
Published Online: 15 FEB 2011
Copyright © 2010 John Wiley & Sons, Inc. All rights reserved.
Wiley Encyclopedia of Operations Research and Management Science
How to Cite
Onn, S. 2011. Polynomial Time Primal Integer Programming via Graver Bases. Wiley Encyclopedia of Operations Research and Management Science. .
- Published Online: 15 FEB 2011
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.
- integer programming;
- primal method;
- transportation problem;
- multicommodity flow;
- combinatorial optimization;
- nonlinear optimization;
- convex optimization;
- Graver basis;
- n-fold product;
- discrete optimization