A Polynomial Time Algorithm for a Special Case of Linear Integer Programming

2011/02/06 by Ghasemiesfeh, Golnaz, Mirzaei, Hanieh, Tabesh, Yahya
#Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences

paper · doi:10.48550/arxiv.1102.1124

Abstract

This article has been withdrawn.

Related

• A Polynomial Time Algorithm For 0-1 Integer Linear Programmings
• Validation of a strongly polynomial-time algorithm for the general linear programming problem
• Why Linear Programming cannot solve large instances of NP-complete problems in polynomial time
• Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
• A polynomial projection-type algorithm for linear programming