Reactive local search techniques for the maximum \(k\)-conjunctive constraint satisfaction problem \((MAX-k-CCSP)\)
type: Item
instance of: scholarly article
title: Reactive local search techniques for the maximum \(k\)-conjunctive constraint satisfaction problem \((MAX-k-CCSP)\)
zbMATH Open document ID: 0941.68149
DOI: 10.1016/S0166-218X(99)00030-X
author: Roberto Battiti
author: Marco Protasi
published in: Discrete Applied Mathematics
publication date: 2000-08-03T00:00:00Z
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 68P10
zbMATH DE Number: 1389861
zbMATH Keywords: Hamming-based reactive tabu search algorithm
describes a project that uses: CCSP
MaRDI profile type: Publication
cites work: New local search approximation techniques for maximum generalized satisfiability problems
cites work: Some APX-completeness results for cubic graphs
cites work: Approximate solution of NP optimization problems
cites work: Local search, reducibility and approximability of NP-optimization problems
cites work: Algorithmic aspects in speech recognition
cites work: Q4375777
cites work: Reactive local search for the maximum clique problem
cites work: The Reactive Tabu Search
cites work: The continuous reactive tabu search: Blending combinatorial optimization and stochastic search for global optimization
cites work: Q3267900
cites work: Bounding the probability of success of stochastic methods for global optimization
cites work: Tabu Search—Part I
cites work: New $\frac{3}{4}$-Approximation Algorithms for the Maximum Satisfiability Problem
cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
cites work: Q4375757
cites work: Algorithms for the maximum satisfiability problem
cites work: ``Neural'' computation of decisions in optimization problems
cites work: How easy is local search?
cites work: On Syntactic versus Computational Views of Approximability
cites work: Optimization by Simulated Annealing
cites work: Optimization, approximation, and complexity classes
cites work: Positive linear programming, parallel approximation and PCP's
cites work: On the Approximation of Maximum Satisfiability
description: scientific article; zbMATH DE number 1389861