首页 | 本学科首页   官方微博 | 高级检索  
     


Integer programming with 2-variable equations and 1-variable inequalities
Authors:Manuel Bodirsky  Timo von Oertzen
Affiliation:a École Polytechnique, LIX (CNRS UMR 7161), Palaiseau, France
b Department of Computer and Information Science, Linköping University, Linköping, Sweden
c Max Planck Institute for Human Development, Berlin, Germany
Abstract:We present an efficient algorithm to find an optimal integer solution of a given system of 2-variable equalities and 1-variable inequalities with respect to a given linear objective function. Our algorithm has worst-case running time in O(N2) where N is the number of bits in the input.
Keywords:Integer programming  Algorithms  Two-variable linear equations
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号