An Asynchronous P System With Branch and Bound for Solving the Satisfiability Problem

International Journal of Networking and Computing
doi 10.15803/ijnc.8.2_141
Full Text
Abstract

Available in full text

Date
Authors
Publisher

IJNC Editorial Committee

Related search

Branch and Bound Methods for Multiobjective Optimization Problem on a Multi-DSP System

IEEJ Transactions on Electronics, Information and Systems
Electronic EngineeringElectrical
1995English

A Branch & Bound Algorithm for the Open-Shop Problem

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
1997English

Solving the Orienteering Problem Through Branch-And-Cut

INFORMS Journal on Computing
Management ScienceComputer Science ApplicationsInformation SystemsOperations ResearchSoftware
1998English

A Branch-And-Bound Method for the Multichromosomal Reversal Median Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
English

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

Optimization Letters
ControlOptimization
2014English

A Branch-And-Bound-Based Crossover Operator for the Traveling Salesman Problem

International Journal of Cognitive Informatics and Natural Intelligence
Human-Computer InteractionArtificial IntelligenceSoftware
2019English

An Enhanced Ant Colony System for Solving Vehicle Routing Problem With Time Window

International Journal of Computer Applications
2013English

An Algorithm for Solving the System-Level Problem in Multilevel Optimization

1994English

A Structural Optimization Solution to a Branch-And-Bound Problem

Quarterly of Applied Mathematics
Applied Mathematics
1977English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy