Intensional sets in CLPDOVIER, A; PONTELLI, E; ROSSI, G et al.Lecture notes in computer science. 2003, pp 284-299, issn 0302-9743, isbn 3-540-20642-6, 16 p.Conference Paper

Discovery of minimal unsatisfiable subsets of constraints using hitting set dualizationBAILEY, James; STUCKEY, Peter J.Lecture notes in computer science. 2005, pp 174-186, issn 0302-9743, isbn 3-540-24362-3, 13 p.Conference Paper

Improved bound computation in presence of several clique constraintsPUGET, Jean-Francois.Lecture notes in computer science. 2004, pp 527-541, issn 0302-9743, isbn 3-540-23241-9, 15 p.Conference Paper

The complexity of Boolean constraint isomorphismBÖHLER, Elmar; HEMASPAANDRA, Edith; REITH, Steffen et al.Lecture notes in computer science. 2004, pp 164-175, issn 0302-9743, isbn 3-540-21236-1, 12 p.Conference Paper

A comparison of CLP(FD) and ASP solutions to NP-complete problemsDOVIER, Agostino; FORMISANO, Andrea; PONTELLI, Enrico et al.Lecture notes in computer science. 2005, pp 67-82, issn 0302-9743, isbn 3-540-29208-X, 1Vol, 16 p.Conference Paper

Filtering methods for symmetric cardinality constraintKOCJAN, Waldemar; KREUGER, Per.Lecture notes in computer science. 2004, pp 200-208, issn 0302-9743, isbn 3-540-21836-X, 9 p.Conference Paper

The all different and global cardinality constraints on set, multiset and tuple variablesQUIMPER, Claude-Guy; WALSH, Toby.Lecture notes in computer science. 2006, pp 1-13, issn 0302-9743, isbn 3-540-34215-X, 1Vol, 13 p.Conference Paper

Improving solver success in reaching feasibility for sets of nonlinear constraints : Algorithms and computational methods in feasibility and infeasibilityIBRAHIM, Walid; CHINNECK, John W.Computers & operations research. 2008, Vol 35, Num 5, pp 1394-1411, issn 0305-0548, 18 p.Article

On-line bicriteria interval schedulingBAILLE, Fabien; BAMPIS, Evripidis; LAFOREST, Christian et al.Lecture notes in computer science. 2005, pp 312-322, issn 0302-9743, isbn 3-540-28700-0, 11 p.Conference Paper

Smodels with CLP and its applications: A simple and effective approach to aggregates in ASPELKABANI, Islam; PONTELLI, Enrico; SON, Tran Cao et al.Lecture notes in computer science. 2004, pp 73-89, issn 0302-9743, isbn 3-540-22671-0, 17 p.Conference Paper

Among, common and disjoint constraintsBESSIERE, Christian; HEBRARD, Emmanuel; HNICH, Brahim et al.Lecture notes in computer science. 2006, pp 29-43, issn 0302-9743, isbn 3-540-34215-X, 1Vol, 15 p.Conference Paper

Regional and online learnable fieldsSCHATTEN, Rolf; GOERKE, Nils; ECKMILLER, Rolf et al.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-28757-4, 2Vol, Part II, 74-83Conference Paper

The effect of deterministic noise in subgradient methodsNEDIC, Angelia; BERTSEKAS, Dimitri P.Mathematical programming (Print). 2010, Vol 125, Num 1, pp 75-99, issn 0025-5610, 25 p.Article

Multirelational k-AnonymityNERGIZ, Mehmet Ercan; CLIFTON, Christopher; NERGIZ, Ahmet Erhan et al.IEEE transactions on knowledge and data engineering. 2009, Vol 21, Num 8, pp 1104-1117, issn 1041-4347, 14 p.Article

An asymptotically optimal linear-time algorithm for locally consistent constraint satisfaction problemsKRAL', Daniel; PANGRAC, Ondrej.Lecture notes in computer science. 2005, pp 603-614, issn 0302-9743, isbn 3-540-28702-7, 12 p.Conference Paper

Approximating the online set multicover problems via randomized winnowingBERMAN, Piotr; DASGUPTA, Bhaskar.Lecture notes in computer science. 2005, pp 110-121, issn 0302-9743, isbn 3-540-28101-0, 12 p.Conference Paper

Inference of well-typings for logic programs with application to termination analysisBRUYNOOGHE, Maurice; GALLAGHER, John; VAN HUMBEECK, Wouter et al.Lecture notes in computer science. 2005, pp 35-51, issn 0302-9743, isbn 3-540-28584-9, 17 p.Conference Paper

Approximation algorithms for the general max-min resource sharing problem: Faster and simplerJANSEN, Klaus.Lecture notes in computer science. 2004, pp 311-322, issn 0302-9743, isbn 3-540-22339-8, 12 p.Conference Paper

Logic and approximation in knowledge based systemsRICHTER, Michael M.Logic versus approximation : essays dedicated to Michael M. Richter on the occasion of his 65th birthday. Lecture notes in computer science. 2004, pp 184-203, issn 0302-9743, isbn 3-540-22562-5, 20 p.Book Chapter

Towards a UML profile for software product linesZIADI, Tewfik; HELOUËT, Loic; JEZEQUEL, Jean-Marc et al.Lecture notes in computer science. 2004, pp 129-139, issn 0302-9743, isbn 3-540-21941-2, 11 p.Conference Paper

Economical and Accurate Protocol for Calculating Hydrogen-Bond-Acceptor StrengthsAHMED EL KERDAWY; TAUTERMANN, Christofer S; CLARK, Timothy et al.Journal of chemical information and modeling. 2013, Vol 53, Num 12, pp 3262-3272, issn 1549-9596, 11 p.Article

Closest assignment constraints in discrete location problemsESPEJO, Inmaculada; MARIN, Alfredo; RODRIGUEZ-CHIA, Antonio M et al.European journal of operational research. 2012, Vol 219, Num 1, pp 49-58, issn 0377-2217, 10 p.Article

Using redundancy to strengthen the relaxation for the global optimization of MINLP problemsRUIZ, Juan P; GROSSMANN, Ignacio E.Computers & chemical engineering. 2011, Vol 35, Num 12, pp 2729-2740, issn 0098-1354, 12 p.Article

Distributionally Robust Optimization and Its Tractable ApproximationsGOH, Joel; SIM, Melvyn.Operations research. 2010, Vol 58, Num 4, pp 902-917, issn 0030-364X, 16 p., 1Article

A hierarchical approach to multimodal classificationSKOWRON, Andrzej; HUI WANG; WOJNA, Arkadiusz et al.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-28653-5, 2Vol, Part II, 119-127Conference Paper