An integral transformation for integer programming problems

  • Authors:

  • Osman Oguz

  • Affiliations:

  • Department of Business Administration, Yarmouk University, IrbidJordan

  • Venue:
  • Operations Research Letters
  • Year:
  • 1985

Quantified Score

Hi-index 0.00

Visualization

Abstract

It is shown that every integer programming problem can be transformed into an equivalent integer program with free variables in polynomial time. The transformation is advantageous because the equivalent problem it generates can be solved very easily in some restricted cases.