Results 241 to 250 of about 133,463 (288)

Investigating the circadian rhythm signaling pathway in HTLV-1 pathogenesis using Boolean analysis. [PDF]

open access: yesVirus Res
Amiri A   +5 more
europepmc   +1 more source
Some of the next articles are maybe not open access.

Related searches:

On duality for Boolean programming

European Journal of Operational Research, 1990
The paper presents a survey on duality for Boolean programming. The author discusses ways to obtain sharp bounds for branch-and-bound algorithms. Linear and nonlinear objective functions and nonlinear representations of the Boolean restrictions on the variables are used in the primal problem to get various forms for the dual problem.
exaly   +3 more sources

Boolean programming problems with fuzzy constraints

Fuzzy Sets and Systems, 1993
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Francisco Herrera, José L Verdegay
exaly   +3 more sources

Pseudo-Boolean Programming

Operations Research, 1969
Many a problem in combinatorial operations research (including, in particular, linear and nonlinear integer programming), can be formulated with the aid of real-valued functions with bivalent (0, 1) variables. This paper surveys the methods originated and developed by the authors for solving such problems.
Hammer, P. L., Rudeanu, S.
openaire   +2 more sources

Hardware verification, Boolean logic programming, Boolean functional programming

Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science, 2002
One of the main obstacles to automatic verification of finite state systems (FSSs) is state explosion. In this respect automatic verification of an FSS M using model checking and binary decision diagrams (BDDs) has an intrinsic limitation: no automatic global optimization of the verification task is possible until a BDD representation for M is ...
openaire   +2 more sources

Relevant Boolean Programming Problems

2016
Quite often, an algorithm that finds either an exact or an approximate solution to a scheduling problem can be derived from a reformulation of the original problem in terms of another problem of combinatorial optimization, e.g., a Boolean programming problem.
Vitaly A. Strusevich, Kabir Rustogi
openaire   +1 more source

Home - About - Disclaimer - Privacy