Mostra el registre d'ítem simple
New constraint learning and inprocessing techniques for Integer Linear Programming.
dc.contributor | Nieuwenhuis, Robert Lukas Mario |
dc.contributor.author | Brufau Vilaró, Oriol |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Ciències de la Computació |
dc.date.accessioned | 2017-02-03T10:30:27Z |
dc.date.issued | 2017-01 |
dc.identifier.uri | http://hdl.handle.net/2117/100537 |
dc.description.abstract | The 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.language.iso | eng |
dc.publisher | Universitat Politècnica de Catalunya |
dc.subject | Àrees temàtiques de la UPC::Matemàtiques i estadística |
dc.subject.lcsh | Computer science |
dc.subject.other | Satisfiability |
dc.subject.other | 0-1 ILP |
dc.subject.other | Pseudo-Boolean |
dc.subject.other | Unit propagation |
dc.subject.other | SAT |
dc.subject.other | Constraint |
dc.title | New constraint learning and inprocessing techniques for Integer Linear Programming. |
dc.type | Bachelor thesis |
dc.subject.lemac | Informàtica |
dc.subject.ams | Classificació AMS::68 Computer science |
dc.identifier.slug | FME-1410 |
dc.rights.access | Restricted access - author's decision |
dc.date.lift | 10000-01-01 |
dc.date.updated | 2017-01-27T07:02:31Z |
dc.audience.educationlevel | Grau |
dc.audience.mediator | Universitat Politècnica de Catalunya. Facultat de Matemàtiques i Estadística |
dc.audience.degree | GRAU EN MATEMÀTIQUES (Pla 2009) |
dc.contributor.covenantee | Barcelogic Solutions |