liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
Integer programming with 2-variable equations and 1-variable inequalities
Ecole Polytechique.
Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory. Linköping University, The Institute of Technology.
Max Planck Institute.
2009 (English)In: INFORMATION PROCESSING LETTERS, ISSN 0020-0190 , Vol. 109, no 11, 572-575 p.Article in journal (Refereed) Published
Abstract [en]

We present an efficient algorithm to find an optimal integer solution of a given system of 2-variable equalities and I-variable inequalities with respect to a given linear objective function. Our algorithm has worst-case running time in O(N-2) where N is the number of bits in the input.

Place, publisher, year, edition, pages
2009. Vol. 109, no 11, 572-575 p.
Keyword [en]
Integer programming, Algorithms, Two-variable linear equations
National Category
Engineering and Technology
URN: urn:nbn:se:liu:diva-18284DOI: 10.1016/j.ipl.2009.01.025OAI: diva2:217860
Available from: 2009-05-17 Created: 2009-05-15 Last updated: 2009-05-17

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Nordh, Gustav
By organisation
TCSLAB - Theoretical Computer Science LaboratoryThe Institute of Technology
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 54 hits
ReferencesLink to record
Permanent link

Direct link