scientific article; zbMATH DE number 3249560
From MaRDI portal
Publication:5538300
zbMath0155.28001MaRDI QIDQ5538300
Peter L. Hammer, Sergiu Rudeanu
Publication date: 1968
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Integer programming (90C10) Mixed integer programming (90C11) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Boolean programming (90C09) Operations research and management science (90B99) Boolean algebras (Boolean rings) (06E99) Logical aspects of Boolean algebras (03G05)
Related Items (only showing first 100 items - show all)
\(f\)-flip strategies for unconstrained binary quadratic programming ⋮ Unimodular functions ⋮ Disjunctive analogues of submodular and supermodular pseudo-Boolean functions ⋮ How to select a small set of diverse solutions to mixed integer programming problems ⋮ Minimization of a quadratic pseudo-Boolean function ⋮ Remarkable polyhedra related to set functions, games and capacities ⋮ On the complexity of some basic problems in computational convexity. I. Containment problems ⋮ Multiobjective optimization for aircraft conflict resolution. A metaheuristic approach ⋮ A lower bound for a constrained quadratic \(0\)-\(1\) minimization problem ⋮ Strong unimodularity for matrices and hypergraphs ⋮ A simplification for some disjunctive formulations ⋮ Interaction transform for bi-set functions over a finite set ⋮ Hybrid column generation for large-size covering integer programs: application to transportation planning ⋮ Aggregation of constraints in integer programming ⋮ On the use of Boolean methods for the computation of the stability number ⋮ Variable and term removal from Boolean formulae ⋮ Game theoretic interaction and decision: a quantum analysis ⋮ A branch and bound method for multi-objective Boolean problems ⋮ Towards an analysis of linguistic modelling ⋮ 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 ⋮ An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs ⋮ Fractional 0-1 programming: applications and algorithms ⋮ Approximation algorithms for discrete polynomial optimization ⋮ Equivalent constraints for discrete sets ⋮ Discrete function expansions in integer powers ⋮ Extensions on solutions of Boolean equations via its conjunctions ⋮ On solving a large-scale problem on facility location and customer assignment with interaction costs along a time horizon ⋮ The unconstrained binary quadratic programming problem: a survey ⋮ New axiomatizations of the Shapley interaction index for bi-capacities ⋮ The arity gap of order-preserving functions and extensions of pseudo-Boolean functions ⋮ A note on the Sobol' indices and interactive criteria ⋮ An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach ⋮ A switching algorithm for the solution of quadratic Boolean equations ⋮ Locally monotone Boolean and pseudo-Boolean functions ⋮ Segmental solutions of Boolean equations ⋮ Symmetric approximations of pseudo-Boolean functions with applications to influence indexes ⋮ Relations between threshold and \(k\)-interval Boolean functions ⋮ An effective structured approach to finding optimal partitions of networks ⋮ Modeling and integer programming techniques applied to propositional calculus ⋮ Probabilistic bounds and algorithms for the maximum satisfiability problem ⋮ The dynamic set covering problem ⋮ Axiomatizations of quasi-Lovász extensions of pseudo-Boolean functions ⋮ On the equivalence of paved-duality and standard linearization in nonlinear 0-1 optimization ⋮ Compact linearization for binary quadratic problems subject to assignment constraints ⋮ Influence and interaction indexes for pseudo-Boolean functions: a unified least squares approach ⋮ Hyperbolic 0-1 programming and query optimization in information retrieval ⋮ On importance indices in multicriteria decision making ⋮ Prominent classes of the most general subsumptive solutions of Boolean equations ⋮ A solvable class of quadratic 0-1 programming ⋮ Reformulating nonlinear combinatorial optimization problems for higher computational efficiency ⋮ Quadratic reformulations of nonlinear binary optimization problems ⋮ A mixed-integer bilevel programming approach for a competitive prioritized set covering problem ⋮ A class of valid inequalities for multilinear 0-1 optimization problems ⋮ Complexity of uniqueness and local search in quadratic 0-1 programming ⋮ Tabu search-based metaheuristic algorithm for software system reliability problems ⋮ Easy and optimal queries to reduce set uncertainty ⋮ Concave extensions for nonlinear 0-1 maximization problems ⋮ Measuring the interactions among variables of functions over the unit hypercube ⋮ Maximization of the Choquet integral over a convex set and its application to resource allocation problems ⋮ Genetic algorithm-based multi-criteria project portfolio selection ⋮ Algebraic and topological closure conditions for classes of pseudo-Boolean functions ⋮ Pseudo-Boolean optimization ⋮ Transforms of pseudo-Boolean random variables ⋮ Aggregation of equations in integer programming ⋮ Robust metaheuristic algorithm for redundancy optimization in large-scale complex systems ⋮ Weighted Banzhaf power and interaction indexes through weighted approximations of games ⋮ Scheduling tasks with exponential duration on unrelated parallel machines ⋮ Hyperbolic set covering problems with competing ground-set elements ⋮ On complexity of unconstrained hyperbolic 0--1 programming problems ⋮ On the closure of families of fuzzy measures under eventwise aggregations ⋮ Convergence of powers of a fuzzy matrix ⋮ An exact penalty function approach for nonlinear integer programming problems ⋮ Integer programming formulation of combinatorial optimization problems ⋮ Using multiple reference levels in multi-criteria decision aid: the generalized-additive independence model and the Choquet integral approaches ⋮ A geometrical interpretation of the Hungarian method ⋮ Une méthode de résolution des équations postiennes à partir d'une solution particuliere ⋮ On the extension of pseudo-Boolean functions for the aggregation of interacting criteria. ⋮ A graph colouring model for assigning a heterogeneous workforce to a given schedule ⋮ Algorithms for the maximum satisfiability problem ⋮ Computational experience with an interior point algorithm on the satisfiability problem ⋮ Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture ⋮ 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 ⋮ On the supermodular knapsack problem ⋮ Convexity and logical analysis of data ⋮ A constrained nonlinear 0-1 program for data allocation ⋮ Determination of weights of interacting criteria from a reference set ⋮ 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 ⋮ On Sugeno integral as an aggregation function ⋮ 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 ⋮ Unconstrained quadratic bivalent programming problem ⋮ Unit integer quadratic binary programming ⋮ One-pass heuristics for large-scale unconstrained binary quadratic problems ⋮ The threshold order of a Boolean function ⋮ The general Steiner problem in Boolean space and application ⋮ An unconstrained quadratic binary programming approach to the vertex coloring problem
This page was built for publication:
