1. Home
  2. Universitat Politècnica de Catalunya
  3. Treballs acadèmics
  4. View Item

New constraint learning and inprocessing techniques for Integer Linear Programming.

Author

Brufau Vilaró, Oriol

Other authors

Universitat Politècnica de Catalunya. Departament de Ciències de la Computació

Barcelogic Solutions

Nieuwenhuis, Robert Lukas Mario

Publication date

2017-01

Share

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.

Document Type

Bachelor thesis

Language

English

Subjects and keywords

Àrees temàtiques de la UPC::Matemàtiques i estadística; Computer science; Satisfiability; 0-1 ILP; Pseudo-Boolean; Unit propagation; SAT; Constraint; Informàtica; Classificació AMS::68 Computer science

Publisher

Universitat Politècnica de Catalunya

Recommended citation

This citation was generated automatically.

Export

DIDL MARC MARC_CCUC METS OAI_DC ORE QDC RDF

Rights

Restricted access - author's decision

This item appears in the following Collection(s)

Treballs acadèmics [82541]