全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

Solving Integer Linear Programs by Exploiting Variable-Constraint Interactions: A Survey

DOI: https://doi.org/10.3390/a12120248

Full-Text   Cite this paper   Add to My Lib

Abstract:

Integer Linear Programming (ILP) is among the most successful and general paradigms for solving computationally intractable optimization problems in computer science. ILP is NP-complete, and until recently we have lacked a systematic study of the complexity of ILP through the lens of variable-constraint interactions. This changed drastically in recent years thanks to a series of results that together lay out a detailed complexity landscape for the problem centered around the structure of graphical representations of instances. The aim of this survey is to summarize these recent developments, put them into context and a unified format, and make them more approachable for experts from many diverse backgrounds. View Full-Tex

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133