A Variable Neighborhood Walksat-Based Algorithm for MAX-SAT Problems

The Scientific World Journal - Egypt
doi 10.1155/2014/798323
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Hindawi Limited

Related search

Randomized Variants of Johnson's Algorithm for MAX SAT

2011English

An Approximation Algorithm for MAX-2-SAT With Cardinality Constraint

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2003English

A Variable Neighborhood Search Heuristic for Periodic Routing Problems

European Journal of Operational Research
Information SystemsSimulationManagement ScienceManagementComputer ScienceModelingOperations Research
2009English

Approximate Solution of Weighted MAX-SAT Problems Using GRASP

DIMACS Series in Discrete Mathematics and Theoretical Computer Science
1997English

FPGA Based Runtime Configurable Clause Evaluator for SAT Problems

Electronics Letters
Electronic EngineeringElectrical
1999English

A GPU-Based Implementation of the Firefly Algorithm for Variable Selection in Multivariate Calibration Problems

PLoS ONE
Multidisciplinary
2014English

Parametric RBAC Maintenance via Max-Sat

2018English

Dynamic Vehicle Routing Using an Improved Variable Neighborhood Search Algorithm

Journal of Applied Mathematics
Applied Mathematics
2013English

A Max-Sat Solver With Lazy Data Structures

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy