Results 191 to 200 of about 133,438 (232)
Some of the next articles are maybe not open access.
Relevant Boolean Programming Problems
2016Quite 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
2013
Boolean programs are a popular abstract domain for static-analysis-based software model checking. Yet little is known about the complexity of model checking for this model of computation. This paper aims to fill this void by providing a comprehensive study of the worst-case complexity of several basic analyses of Boolean programs, including ...
Patrice Godefroid, Mihalis Yannakakis
openaire +1 more source
Boolean programs are a popular abstract domain for static-analysis-based software model checking. Yet little is known about the complexity of model checking for this model of computation. This paper aims to fill this void by providing a comprehensive study of the worst-case complexity of several basic analyses of Boolean programs, including ...
Patrice Godefroid, Mihalis Yannakakis
openaire +1 more source
Bilevel Biobjective Pseudo Boolean Programming Problems
Journal of Mathematical Modelling and Algorithms, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Logics of Programs with Boolean Memory
Fundamenta Informaticae, 1988We discuss the computational power of programs with boolean (propositional) push-down stores and arrays, and the expressive power of logics based on these programs. In particular we show that over unary structures, the mentioned logics occur to be equivalent to their “algebraic counterparts.
openaire +2 more sources
Extensions of Pseudo-Boolean Programming
1968In this chapter, various generalizations of the problem of minimizing a pseudo-Boolean function will be studied.
Peter L. Hammer, Sergiu Rudeanu
openaire +1 more source
1979
Various problems in life and industry require deciding amongst various choices in order to give the greatest good or the least evil. These decisions can sometimes be made in a straightforward manner, but often there are restrictions upon the actions we can take. This complicates the decision process, so various techniques have been invented to aid the
openaire +1 more source
Various problems in life and industry require deciding amongst various choices in order to give the greatest good or the least evil. These decisions can sometimes be made in a straightforward manner, but often there are restrictions upon the actions we can take. This complicates the decision process, so various techniques have been invented to aid the
openaire +1 more source
Boolean programming problems with fuzzy constraints
Fuzzy Sets and Systems, 1993zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Herrera, F. +2 more
openaire +2 more sources
1965
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.
openaire +1 more source
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.
openaire +1 more source
On duality for Boolean programming
European Journal of Operational Research, 1990The 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.
openaire +2 more sources
Programming Boolean expressions for testability
2004 IEEE Aerospace Conference Proceedings (IEEE Cat. No.04TH8720), 2005This paper proposes several methods for programming the Boolean expressions in a flight control program that makes them amenable for exhaustive testing. It first describes the current FAA approach that accepts arbitrary Boolean expressions and attempts to apply the test known as modified condition/decision coverage (MC/DC).
openaire +1 more source