Please use this identifier to cite or link to this item: https://doi.org/10.15480/882.1839
Fulltext available Open Access
Title: Evaluating the performance of solvers for integer-linear programming
Language: English
Authors: Luppold, Arno  
Oehlert, Dominic 
Falk, Heiko  
Editor: Eingebettete Systeme E-13 
Keywords: Integer-Linear Programming;ILP;Solvers;Evaluation
Issue Date: 2018
Abstract (english): Optimizing embedded systems often boils down to solving complex combinatorial optimization problems. Integer-Linear Programming (ILP) turned out to be a powerful tool to solve these problems, as beyond traditional constraints, Boolean variables may be used to model complex logical expressions and conditionals. One of the key technical aspects is to be able to efficiently express these relations within the ILP. This paper presents formalized solutions for these issues, as well as an assessment of common ILP solvers. Additionally, the performance impact is illustrated using a compiler based cache aging optimization.
URI: http://tubdok.tub.tuhh.de/handle/11420/1842
DOI: 10.15480/882.1839
Institute: Eingebettete Systeme E-13 
Type: Report (Bericht)
Funded by: Deutsche Forschungsgemeinschaft
Project: Multi-Opt - Multikriterielle Code-Optimierung für Eingebettete Harte Echtzeitsysteme (Grant FA 1017/3-1) 
Appears in Collections:Publications (tub.dok)

Files in This Item:
File Description SizeFormat
ilp.pdfEvaluating the Performance of Solvers for Integer-Linear Programming405,63 kBAdobe PDFThumbnail
View/Open
Show full item record

Page view(s)

92
Last Week
0
Last month
5
checked on Aug 20, 2019

Download(s)

57
checked on Aug 20, 2019

Google ScholarTM

Check

Export

This item is licensed under a Creative Commons License Creative Commons