The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase MAX-CSP (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1996-2001 (16) 2002-2005 (18) 2006-2008 (17) 2009-2024 (11)
Publication types (Num. hits)
article(20) inproceedings(42)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 19 occurrences of 17 keywords

Results
Found 62 publication records. Showing 62 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
104Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà Encoding Max-CSP into Partial Max-SAT. Search on Bibsonomy ISMVL The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Minimal Support, Max-CSP, Partial Max-SAT, Encodings
90Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems. Search on Bibsonomy CSR The full citation details ... 2007 DBLP  DOI  BibTeX  RDF maximum constraint satisfaction, complexity, approximability
77Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà Modelling Max-CSP as Partial Max-SAT. Search on Bibsonomy SAT The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
74David A. Cohen, Martin C. Cooper, Peter Jeavons 0001, Andrei A. Krokhin Identifying Efficiently Solvable Cases of Max CSP. Search on Bibsonomy STACS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
53Thierry Petit, Jean-Charles Régin, Christian Bessière Meta-constraints on violations for over constrained problems. Search on Bibsonomy ICTAI The full citation details ... 2000 DBLP  DOI  BibTeX  RDF meta constraints, over constrained problems, Max-CSP, real-life problems, constraint programming, constraint handling, communicating sequential processes, real-world problems
50Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà Sequential Encodings from Max-CSP into Partial Max-SAT. Search on Bibsonomy SAT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
48Vladimir G. Deineko, Peter Jonsson, Mikael Klasson, Andrei A. Krokhin The approximability of MAX CSP with fixed-value constraints. Search on Bibsonomy J. ACM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Complexity of approximation, maximum constraint satisfaction, dichotomy, Monge properties, supermodularity
48Thierry Petit, Jean-Charles Régin, Christian Bessière Range-Based Algorithm for Max-CSP. Search on Bibsonomy CP The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
43Simon de Givry, Javier Larrosa, Pedro Meseguer, Thomas Schiex Solving Max-SAT as Weighted CSP. Search on Bibsonomy CP The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
42Jean-Marie Normand, Alexandre Goldsztejn, Marc Christie, Frédéric Benhamou A Branch and Bound Algorithm for Numerical MAX-CSP. Search on Bibsonomy CP The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
40Thomas Schiex Arc Consistency for Soft Constraints. Search on Bibsonomy CP The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
39Gustav Hast Beating a Random Assignment. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
35Madalina Ionita, Cornelius Croitoru, Mihaela Breaban Incorporating Inference into Evolutionary Algorithms for Max-CSP. Search on Bibsonomy Hybrid Metaheuristics The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
35Mohand Ou Idir Khemmoudj, Hachemi Bennaceur Clique Inference Process for Solving Max-CSP. Search on Bibsonomy CP The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
35Rafael Ceballos, Rafael M. Gasca, Carmelo Del Valle, Miguel Toro Max-CSP Approach for Software Diagnosis. Search on Bibsonomy IBERAMIA The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
35Kalev Kask New Search Heuristics for Max-CSP. Search on Bibsonomy CP The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
31Josep Argelich, Felip Manyà Exact Max-SAT solvers for over-constrained problems. Search on Bibsonomy J. Heuristics The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Soft constraints, Solvers, Max-SAT
31Xi Chen 0001, Chenghao Guo, Emmanouil V. Vlatakis-Gkaragkounis, Mihalis Yannakakis, Xinzhi Zhang 0002 Smoothed complexity of local max-cut and binary max-CSP. Search on Bibsonomy STOC The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
31Xi Chen 0001, Chenghao Guo, Emmanouil V. Vlatakis-Gkaragkounis, Mihalis Yannakakis, Xinzhi Zhang 0002 Smoothed complexity of local Max-Cut and binary Max-CSP. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
31Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà Regular Encodings from Max-CSP into Partial Max-SAT. Search on Bibsonomy ISMVL The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
31Alex D. Scott, Gregory B. Sorkin Faster Algorithms for MAX CUT and MAX CSP, with Polynomial Expected Time for Sparse Instances. Search on Bibsonomy RANDOM-APPROX The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
27Martin C. Cooper High-Order Consistency in Valued Constraint Satisfaction. Search on Bibsonomy Constraints An Int. J. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF discrete optimisation, valued constraint satisfaction, consistency enforcing, MAX-CSP, soft constraints
26Andrei A. Krokhin, Benoît Larose Maximum Constraint Satisfaction on Diamonds. Search on Bibsonomy CP The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
26Rina Dechter, Kalev Kask, Javier Larrosa A General Scheme for Multiple Lower Bound Computation in Constraint Optimization. Search on Bibsonomy CP The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
26Jean-Charles Régin, Thierry Petit, Christian Bessière, Jean-Francois Puget New Lower Bounds of Constraint Violations for Over-Constrained Problems. Search on Bibsonomy CP The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
26Meriema Belaidouni, Jin-Kao Hao An Analysis of the Configuration Space of the Maximal Constraint Satisfaction Problem. Search on Bibsonomy PPSN The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
26Javier Larrosa Boosting Search with Variable Elimination. Search on Bibsonomy CP The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
24Josep Argelich, Felip Manyà Solving Over-Constrained Problems with SAT Technology. Search on Bibsonomy SAT The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
22Bart M. P. Jansen, Michal Wlodarczyk 0001 Optimal Polynomial-Time Compression for Boolean Max CSP. Search on Bibsonomy ACM Trans. Comput. Theory The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
22Bart M. P. Jansen, Michal Wlodarczyk 0001 Optimal polynomial-time compression for Boolean Max CSP. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
22Bart M. P. Jansen, Michal Wlodarczyk 0001 Optimal Polynomial-Time Compression for Boolean Max CSP. Search on Bibsonomy ESA The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
22Martin C. Cooper, Guillaume Escamocher, Stanislav Zivný A Characterisation of the Complexity of Forbidding Subproblems in Binary Max-CSP. Search on Bibsonomy CP The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
22Jean-Marie Normand, Alexandre Goldsztejn, Marc Christie, Frédéric Benhamou A branch and bound algorithm for numerical Max-CSP. Search on Bibsonomy Constraints An Int. J. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
22Mohand Ou Idir Khemmoudj, Hachemi Bennaceur Clique inference process for solving Max-CSP. Search on Bibsonomy Eur. J. Oper. Res. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
22Hachemi Bennaceur, Christophe Lecoutre, Olivier Roussel A Decomposition Technique for Max-CSP. Search on Bibsonomy ECAI The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
22Wenceslas Fernandez de la Vega, Ravi Kannan, Marek Karpinski Approximation of Global MAX-CSP Problems. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2006 DBLP  BibTeX  RDF
22Wenceslas Fernandez de la Vega, Marek Karpinski Trading Tensors for Cloning: Constant Time Approximation Schemes for Metric MAX-CSP. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2006 DBLP  BibTeX  RDF
22Vladimir G. Deineko, Peter Jonsson, Mikael Klasson, Andrei A. Krokhin The approximability of MAX CSP with fixed-value constraints Search on Bibsonomy CoRR The full citation details ... 2006 DBLP  BibTeX  RDF
22Peter Jonsson, Mikael Klasson, Andrei A. Krokhin The Approximability of Three-valued MAX CSP. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
22David A. Cohen, Martin C. Cooper, Peter Jeavons 0001, Andrei A. Krokhin Supermodular functions and the complexity of MAX CSP. Search on Bibsonomy Discret. Appl. Math. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
22Peter Jonsson, Mikael Klasson, Andrei A. Krokhin The approximability of three-valued MAX CSP Search on Bibsonomy CoRR The full citation details ... 2004 DBLP  BibTeX  RDF
22Mayur Datar, Tomás Feder, Aristides Gionis, Rajeev Motwani 0001, Rina Panigrahy A combinatorial algorithm for MAX CSP. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
22Hachemi Bennaceur, Aomar Osmani Computing Lower Bound for MAX-CSP Problems. Search on Bibsonomy IEA/AIE The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
22Javier Larrosa, Pedro Meseguer Partition-Based Lower Bound for Max-CSP. Search on Bibsonomy Constraints An Int. J. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
22R. Cevallos, Rafael M. Gasca, Carmelo Del Valle, Miguel Toro Diagnosis de Software usando técnicas Max-CSP. Search on Bibsonomy JISBD The full citation details ... 2002 DBLP  BibTeX  RDF
22Noga Alon, Wenceslas Fernandez de la Vega, Ravi Kannan, Marek Karpinski Random sampling and approximation of MAX-CSP problems. Search on Bibsonomy STOC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
22Noga Alon, Wenceslas Fernandez de la Vega, Ravi Kannan, Marek Karpinski Random Sampling and Approximation of MAX-CSP Problems Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2001 DBLP  BibTeX  RDF
22Javier Larrosa, Pedro Meseguer, Thomas Schiex Maintaining Reversible DAC for Max-CSP. Search on Bibsonomy Artif. Intell. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
22Javier Larrosa, Pedro Meseguer Partition-Based Lower Bound for Max-CSP. Search on Bibsonomy CP The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
22Javier Larrosa, Pedro Meseguer, Thomas Schiex, Gérard Verfaillie Reversible DAC and Other Improvements for Solving Max-CSP. Search on Bibsonomy AAAI/IAAI The full citation details ... 1998 DBLP  BibTeX  RDF
22Mohamed-Salah Affane, Hachemi Bennaceur A Weighted Arc Consistency Technique for MAX-CSP. Search on Bibsonomy ECAI The full citation details ... 1998 DBLP  BibTeX  RDF
22Javier Larrosa, Pedro Meseguer Partial Lazy Forward Checking for MAX-CSP. Search on Bibsonomy ECAI The full citation details ... 1998 DBLP  BibTeX  RDF
22Javier Larrosa, Pedro Meseguer Phase Transition in MAX-CSP. Search on Bibsonomy ECAI The full citation details ... 1996 DBLP  BibTeX  RDF
22Javier Larrosa, Pedro Meseguer Exploiting the Use of DAC in MAX-CSP. Search on Bibsonomy CP The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
20Jean-Philippe Métivier, Patrice Boizumault, Samir Loudni All Different: Softening AllDifferent in Weighted CSPs. Search on Bibsonomy ICTAI (1) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
20Javier Larrosa, Rina Dechter Boosting Search with Variable Elimination in Constraint Optimization and Constraint Satisfaction Problems. Search on Bibsonomy Constraints An Int. J. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF bucket elimination, constraint satisfaction, branch and bound, soft constraints, constraint optimization
18Federico Heras, Javier Larrosa Intelligent variable orderings and re-orderings in DAC-based solvers for WCSP. Search on Bibsonomy J. Heuristics The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Weighted CSPs, Local consistency
13Amin Coja-Oghlan, Colin Cooper, Alan M. Frieze An efficient sparse regularity concept. Search on Bibsonomy SODA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
13Mihaela Breaban, Madalina Ionita, Cornelius Croitoru A new PSO approach to constraint satisfaction. Search on Bibsonomy IEEE Congress on Evolutionary Computation The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
13Madalina Ionita, Mihaela Breaban, Cornelius Croitoru A New Scheme of Using Inference Inside Evolutionary Computation Techniques to Solve CSPs. Search on Bibsonomy SYNASC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
13Sadok Bouamama, Jlifi Boutheina, Khaled Ghédira D2G2A: A Distributed Double Guided Genetic Algorithm for Max_CSPs. Search on Bibsonomy KES The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
13Rosella Gennari Translations for Comparing Soft Frameworks. Search on Bibsonomy CP The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #62 of 62 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license