Standard Article

Polynomial Time Primal Integer Programming via Graver Bases

  1. Shmuel Onn

Published Online: 15 FEB 2011

DOI: 10.1002/9780470400531.eorms0677

Wiley Encyclopedia of Operations Research and Management Science

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. .

Author Information

  1. Technion, Israel Institute of Technology, Haifa, Israel

Publication History

  1. Published Online: 15 FEB 2011

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.

Keywords:

  • integer programming;
  • primal method;
  • transportation problem;
  • multicommodity flow;
  • combinatorial optimization;
  • nonlinear optimization;
  • convex optimization;
  • Graver basis;
  • n-fold product;
  • discrete optimization