A Genetic Algorithm With Expansion and Exploration Operators for the Maximum Satisfiability Problem

Applied Mathematical Sciences
doi 10.12988/ams.2013.13107
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Hikari, Ltd.

Related search

A Genetic Algorithm With Expansion Operator for the 3-Satisfiability Problem

Advanced Studies in Theoretical Physics
Mathematical PhysicsPhysicsAstronomy
2013English

Pattern Backtracking Algorithm for the Workflow Satisfiability Problem With User-Independent Constraints

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2015English

Automated Design Debugging With Maximum Satisfiability

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
ElectricalSoftwareComputer GraphicsComputer-Aided DesignElectronic Engineering
2010English

A Parallel Branch and Bound Algorithm for the Maximum Labelled Clique Problem

Optimization Letters
ControlOptimization
2014English

CCEHC: An Efficient Local Search Algorithm for Weighted Partial Maximum Satisfiability (Extended Abstract)

2017English

R-Evo: A Reactive Evolutionary Algorithm for the Maximum Clique Problem

IEEE Transactions on Evolutionary Computation
Theoretical Computer ScienceComputational TheorySoftwareMathematics
2011English

A Binary Harmony Search Algorithm for Solving the Maximum Clique Problem

International Journal of Computer Applications
2013English

A Genetic Algorithm for the Parallel Machine Scheduling Problem With Consumable Resources

International Journal of Applied Metaheuristic Computing
ControlStatisticsProbabilityOptimizationDecision SciencesComputational TheorySimulationComputer Science ApplicationsComputational MathematicsMathematicsModeling
2013English

A Simple Genetic Algorithm for the Job-Scheduling Problem

2010English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy