Show simple item record

dc.contributorNieuwenhuis, Robert Lukas Mario
dc.contributor.authorBrufau Vilaró, Oriol
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.description.abstractThe IntSat procedure [Nieuwenhuis 2014] is a complete method for Integer Linear Programming (ILP) based on conflict-driven constraint learning, extending similar ideas used in propositional satisfiability solving (SAT). The aim of this project is, restricted to the Pseudo-Boolean ILP case, to extend this method with new inprocessing techniques, proving the associated correctness and completeness properties, developing data structures and algorithms for their implementation, and providing a careful and extensive experimental assessment for them.
dc.publisherUniversitat Politècnica de Catalunya
dc.subjectÀrees temàtiques de la UPC::Matemàtiques i estadística
dc.subject.lcshComputer science
dc.subject.other0-1 ILP
dc.subject.otherUnit propagation
dc.titleNew constraint learning and inprocessing techniques for Integer Linear Programming.
dc.typeBachelor thesis
dc.subject.amsClassificació AMS::68 Computer science
dc.rights.accessRestricted access - author's decision
dc.audience.mediatorUniversitat Politècnica de Catalunya. Facultat de Matemàtiques i Estadística

Files in this item


This item appears in the following Collection(s)

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder