scientific article; zbMATH DE number 3249560

Logical aspects of Boolean algebras (03G05) Boolean algebras (Boolean rings) (06E99) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Operations research and management science (90B99) Boolean programming (90C09) Integer programming (90C10) Mixed integer programming (90C11) Programming involving graphs or networks (90C35)

Recommendations

scientific article; zbMATH DE number 279605
scientific article; zbMATH DE number 38107
Boolean Methods of Optimization over Independence Systems
Advanced Boolean Techniques
scientific article; zbMATH DE number 5785317
Boolean lexicographic optimization: algorithms \& applications
scientific article; zbMATH DE number 279581
scientific article; zbMATH DE number 3339956
An approach to the construction of approximate solutions of Boolean linear programming problems
Publication:3204332

Cited in

(only showing first 100 items - show all)

Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
Maximization of submodular functions: theory and enumeration algorithms
The interaction transform for functions on lattices
Minimizing a linear fractional function subject to a system of sup-\(T\) equations with a continuous Archimedean triangular norm
Unit integer quadratic binary programming
Unimodular functions
Strong unimodularity for matrices and hypergraphs
A simplification for some disjunctive formulations
Aggregation of constraints in integer programming
The worst case behavior of a greedy algorithm for a class of pseudo- Boolean functions
Recognition problems for special classes of polynomials in 0-1 variables
Equivalent constraints for discrete sets
Discrete function expansions in integer powers
A switching algorithm for the solution of quadratic Boolean equations
Segmental solutions of Boolean equations
An effective structured approach to finding optimal partitions of networks
The dynamic set covering problem
On the equivalence of paved-duality and standard linearization in nonlinear 0-1 optimization
Hyperbolic 0-1 programming and query optimization in information retrieval
A solvable class of quadratic 0-1 programming
Reformulating nonlinear combinatorial optimization problems for higher computational efficiency
Complexity of uniqueness and local search in quadratic 0-1 programming
Aggregation of equations in integer programming
Convergence of powers of a fuzzy matrix
Integer programming formulation of combinatorial optimization problems
A geometrical interpretation of the Hungarian method
Une méthode de résolution des équations postiennes à partir d'une solution particuliere
A graph colouring model for assigning a heterogeneous workforce to a given schedule
A constrained nonlinear 0-1 program for data allocation
Minimization of a quadratic pseudo-Boolean function
On the complexity of some basic problems in computational convexity. I. Containment problems
A lower bound for a constrained quadratic \(0\)-\(1\) minimization problem
On the use of Boolean methods for the computation of the stability number
Variable and term removal from Boolean formulae
Extensions on solutions of Boolean equations via its conjunctions
Convexity and logical analysis of data
Determination of weights of interacting criteria from a reference set
On Sugeno integral as an aggregation function
One-pass heuristics for large-scale unconstrained binary quadratic problems
Game theoretic interaction and decision: a quantum analysis
Fractional 0-1 programming: applications and algorithms
On solving a large-scale problem on facility location and customer assignment with interaction costs along a time horizon
A note on the Sobol' indices and interactive criteria
Compact linearization for binary quadratic problems subject to assignment constraints
On importance indices in multicriteria decision making
A mixed-integer bilevel programming approach for a competitive prioritized set covering problem
A class of valid inequalities for multilinear 0-1 optimization problems
Easy and optimal queries to reduce set uncertainty
Maximization of the Choquet integral over a convex set and its application to resource allocation problems
Genetic algorithm-based multi-criteria project portfolio selection
Robust metaheuristic algorithm for redundancy optimization in large-scale complex systems
On complexity of unconstrained hyperbolic 0--1 programming problems
On the closure of families of fuzzy measures under eventwise aggregations
On the extension of pseudo-Boolean functions for the aggregation of interacting criteria.
On the supermodular knapsack problem
Special issue: Boolean functions and related problems
Disjunctive and conjunctive normal forms of pseudo-Boolean functions
The influence of variables on pseudo-Boolean functions with applications to game theory and multicriteria decision making
Disjunctive analogues of submodular and supermodular pseudo-Boolean functions
Exact and approximate discrete optimization algorithms for finding useful disjunctions of categorical predicates in data analysis
Extending shelling orders and a hierarchy of functions of unimodal simple polytopes
A unified approach to polynomially solvable cases of integer ``non-separable quadratic optimization
Boolean differential equations
Boolean regression
On Postian algebraic equations
Properties of quasi-Boolean function on quasi-Boolean algebra
Best second order bounds for two-terminal network reliability with dependent edge failures
Mixed logical-linear programming
Berge-acyclic multilinear 0-1 optimization problems
Pseudo-Boolean conditional optimization models for a class of multiple traveling salesmen problems
Aircraft deconfliction with speed regulation: new models from mixed-integer optimization
Local search algorithms for the problem of competitive location of enterprises
Minimization of pseudo-Boolean functions by binary development
The reliability importance of components and prime implicants in coherent and non-coherent systems including total-order interactions
Merging the local and global approaches to probabilistic satisfiability
Interaction indices for games on combinatorial structures with forbidden coalitions
On Boolean characterizations of planarity and planar embeddings of graphs
The basic algorithm for pseudo-Boolean programming revisited
SPASS-SATT. A CDCL(LA) solver
Compact quadratizations for pseudo-Boolean functions
A multiple-try Metropolis-Hastings algorithm with tailored proposals
Prior specification for binary Markov mesh models
Approximate computations for binary Markov random fields and their use in Bayesian models
Bilevel biobjective pseudo Boolean programming problems
Uniqueness in quadratic and hyperbolic \(0-1\) programming problems
MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
A new approach for modeling and solving set packing problems
Approximations of Lovász extensions and their induced interaction index
Compact linearization for binary quadratic problems
Using \(xQx\) to model and solve the uncapacitated task allocation problem
Continuous dynamical systems that realize discrete optimization on the hypercube
Irredundant optimization of a pseudo-Boolean function
Applications of pseudo-Boolean methods to economic problems
Similarity relations and fuzzy orderings
Transformation of integer programs to knapsack problems
Multivariable monotonic optimization over multivalued logics and rectangular design lattices
Normalformen planarer Graphen. II
Parametric solutions of Boolean equations
A FORTRAN program for the solution of simultaneous linear Boolean inequalities by the algorithm of Hammer and Rudeanu
Über die Bestimmung von Kernen in endlichen Graphen

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5538300)