An integral transformation for integer programming problems
type: Item
instance of: scholarly article
title: An integral transformation for integer programming problems
zbMATH Open document ID: 0572.90077
DOI: 10.1016/0167-6377(85)90014-8
author: Osman Oguz
published in: Operations Research Letters
publication date: 1985-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 3914091
zbMATH Keywords: equivalent problem transformation
zbMATH Keywords: polynomial transformation procedure
zbMATH Keywords: free variables
MaRDI profile type: Publication
full work available at URL: 0167-6377(85)90014-8
OpenAlex ID: W2026913162
cites work: Q5629680
cites work: Q4198056
cites work: A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables
cites work: A Polynomial Algorithm for the Two-Variable Integer Programming Problem
cites work: Integer Programming with a Fixed Number of Variables
Recommended article: On an integral transformation for integer programming
Recommended article: The integral basis method for integer programming
Recommended article: Integer programming as a framework for optimization and approximability
Recommended article: Transformation of integer programs to knapsack problems
Recommended article: The discrete Ψ -transformation method in integer programming
Recommended article: Q4841053
Recommended article: An approach to the solution of integer optimization problems
Recommended article: Q3475127
Recommended article: The integrality number of an integer program
description: scientific article; zbMATH DE number 3914091