Mostra el registre d'ítem simple
The IntSat method for integer linear programming
| dc.contributor.author | Nieuwenhuis, Robert Lukas Mario |
| dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Ciències de la Computació |
| dc.date.accessioned | 2014-10-14T07:43:08Z |
| dc.date.available | 2015-10-01T00:30:48Z |
| dc.date.created | 2014 |
| dc.date.issued | 2014 |
| dc.identifier.citation | Nieuwenhuis, R. The IntSat method for integer linear programming. A: International Conference on Principles and Practice of Constraint Programming. "Principles and Practice of Constraint Programming: 20th International Conference, CP 2014, Lyon, France, September 8-12, 2014: proceedings". Lyon: Springer, 2014, p. 574-589. |
| dc.identifier.isbn | 978-3-319-10428-7 |
| dc.identifier.uri | http://hdl.handle.net/2117/24361 |
| dc.description.abstract | Conflict-Driven Clause-Learning (CDCL) SAT solvers can automatically solve very large real-world problems. To go beyond, and in particular in order to solve and optimize problems involving linear arithmetic constraints, here we introduce IntSat, a generalization of CDCL to Integer Linear Programming (ILP). Our simple 1400-line C++ prototype IntSat implementation already shows some competitiveness with commercial solvers such as CPLEX or Gurobi. Here we describe this new IntSat ILP solving method, show how it can be implemented efficiently, and discuss a large list of possible enhancements and extensions. |
| dc.format.extent | 16 p. |
| dc.language.iso | eng |
| dc.publisher | Springer |
| dc.subject | Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica |
| dc.subject.lcsh | Linear programming |
| dc.subject.other | Computer programming |
| dc.subject.other | Integer programming |
| dc.subject.other | Commercial solvers |
| dc.subject.other | Integer linear programming |
| dc.subject.other | Linear arithmetic constraints |
| dc.subject.other | Real-world problem |
| dc.subject.other | SAT solvers |
| dc.subject.other | Solving method |
| dc.subject.other | Constraint theory |
| dc.title | The IntSat method for integer linear programming |
| dc.type | Conference report |
| dc.subject.lemac | Programació lineal |
| dc.contributor.group | Universitat Politècnica de Catalunya. LOGPROG - Lògica i Programació |
| dc.identifier.doi | 10.1007/978-3-319-10428-7_42 |
| dc.relation.publisherversion | http://link.springer.com/chapter/10.1007%2F978-3-319-10428-7_42 |
| dc.rights.access | Open Access |
| local.identifier.drac | 15229019 |
| dc.description.version | Postprint (author’s final draft) |
| local.citation.author | Nieuwenhuis, R. |
| local.citation.contributor | International Conference on Principles and Practice of Constraint Programming |
| local.citation.pubplace | Lyon |
| local.citation.publicationName | Principles and Practice of Constraint Programming: 20th International Conference, CP 2014, Lyon, France, September 8-12, 2014: proceedings |
| local.citation.startingPage | 574 |
| local.citation.endingPage | 589 |
