Cluster of Articles on Connections between Integer Programming and Constraint Logic Programming - An Incremental Branch-and-Bound Method for the Satisfiability Problem
Year of publication: |
1998
|
---|---|
Authors: | Bennaceur, Hachemi ; Gouachi, Idir ; Plateau, GĂ©rard |
Published in: |
INFORMS journal on computing : JOC. - Linthicum, Md : INFORMS, ISSN 0899-1499, ZDB-ID 13160771. - Vol. 10.1998, 3, p. 301-308
|
Saved in:
Saved in favorites
Similar items by person
-
Clique inference process for solving Max-CSP
Khemmoudj, Mohand Ou Idir, (2009)
-
Clique inference process for solving Max-CSP
Idir Khemmoudj, Mohand Ou, (2009)
-
Clique inference process for solving Max-CSP
Khemmoudj, Idir, (2009)
- More ...