Pseudo-Boolean optimization

From MaRDI portal

Publication:697569

Jump to:navigation, search

DOI10.1016/S0166-218X(01)00341-9zbMath1076.90032MaRDI QIDQ697569

Peter L. Hammer, Endre Boros

Publication date: 17 September 2002

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Boolean programming (90C09) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items

On characterization of maximal independent sets via quadratic optimization, Exact solution approaches for bilevel assignment problems, Disjunctive analogues of submodular and supermodular pseudo-Boolean functions, Optimal testing and repairing a failed series system, Exact and approximate discrete optimization algorithms for finding useful disjunctions of categorical predicates in data analysis, Building an iterative heuristic solver for a quantum annealer, Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications, On total variation minimization and surface evolution using parametric maximum flows, Satisfying more than half of a system of linear equations over GF(2): a multivariate approach, Fast three-valued abstract bit-vector arithmetic, Optimizing adiabatic quantum program compilation using a graph-theoretic framework, A global optimization algorithm for solving the minimum multiple ratio spanning tree problem, Discrete dynamical system approaches for Boolean polynomial optimization, Modularity-based decompositions for valued CSP, Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem, QUBO formulations of the longest path problem, Fixation probabilities in evolutionary dynamics under weak selection, From matchings to independent sets, Estimating arrival rate of nonhomogeneous Poisson processes with semidefinite programming, Equal risk bounding is better than risk parity for portfolio selection, Fractional 0-1 programming: applications and algorithms, Classes of submodular constraints expressible by graph cuts, Facet-inducing web and antiweb inequalities for the graph coloring polytope, The bipartite Boolean quadric polytope, Minimizing energies with hierarchical costs, FPGA implementation of a stochastic neural network for monotonic pseudo-Boolean optimization, Branch-and-mincut: global optimization for image segmentation with high-level priors, The unconstrained binary quadratic programming problem: a survey, Fast approximate energy minimization with label costs, On the complexity and approximation of the maximum expected value all-or-nothing subset, Optimal quadratic reformulations of fourth degree pseudo-Boolean functions, Generalized roof duality and bisubmodular functions, Directed acyclic graph continuous max-flow image segmentation for unconstrained label orderings, A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems, A framework for certified Boolean branch-and-bound optimization, An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach, Stability preserving transformations of graphs, Cuts in undirected graphs. I, On finite potential games, Uniqueness in quadratic and hyperbolic \(0-1\) programming problems, A note on representations of linear inequalities in non-convex mixed-integer quadratic programs, Adiabatic quantum programming: minor embedding with hard faults, Boolean-controlled systems via receding horizon and linear programing, The complexity of soft constraint satisfaction, Data aggregation for \(p\)-median problems, Quadratic convex reformulations for quadratic 0-1 programming, A new approach for modeling and solving set packing problems, Cross-layer optimization in ultra wideband networks, A network approach for specially structured linear programs arising in 0-1 quadratic optimization, Efficient minimization of higher order submodular functions using monotonic Boolean functions, A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO), Ising formulations of some graph-theoretic problems in psychological research: models and methods, Berge-acyclic multilinear 0-1 optimization problems, A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs, Quadratic reformulations of nonlinear binary optimization problems, Norm bounds and underestimators for unconstrained polynomial integer minimization, A class of valid inequalities for multilinear 0-1 optimization problems, The expressive power of valued constraints: Hierarchies and collapses, Efficient branch-and-bound algorithms for weighted MAX-2-SAT, Genetic algorithm-based multi-criteria project portfolio selection, The expressive power of binary submodular functions, Solving a cut problem in bipartite graphs by linear programming: application to a forest management problem, Soft arc consistency revisited, Minor-embedding in adiabatic quantum computation. II: Minor-universal graph design, Using \(xQx\) to model and solve the uncapacitated task allocation problem, Subset-conjunctive rules for breast cancer diagnosis, A tight lower bound for a special case of quadratic 0-1 programming, Global optimality conditions for quadratic \(0-1\) optimization problems, A case study in programming a quantum annealer for hard operational planning problems, Exact solution approach for a class of nonlinear bilevel knapsack problems, Hypercontractive inequality for pseudo-Boolean functions of bounded Fourier width, Multiagent resource allocation in \(k\)-additive domains: preference representation and complexity, Generalized roof duality, On complexity of unconstrained hyperbolic 0--1 programming problems, Fractional 0-1 programs: links between mixed-integer linear and conic quadratic formulations, Differential approximation schemes for half-product related functions and their scheduling applications, Approximability issues for unconstrained and constrained maximization of half-product related functions, Minor-embedding in adiabatic quantum computation. I: The parameter setting problem, The complexity of approximating conservative counting CSPs, Minimization of locally defined submodular functions by optimal soft arc consistency, Compact quadratizations for pseudo-Boolean functions, A linearization framework for unconstrained quadratic (0-1) problems, Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem, Matroid optimization problems with monotone monomials in the objective, A global continuation algorithm for solving binary quadratic programming problems, Pseudo-Boolean conditional optimization models for a class of multiple traveling salesmen problems, The potential of quantum annealing for rapid solution structure identification, New algorithms for convex cost tension problem with application to computer vision, Minimizing a linear fractional function subject to a system of sup-\(T\) equations with a continuous Archimedean triangular norm, A new separation algorithm for the Boolean quadric and cut polytopes, New approaches for optimizing over the semimetric polytope, Quadratic and higher-order unconstrained binary optimization of railway rescheduling for quantum computing, Hard combinatorial problems and minor embeddings on lattice graphs, The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases, Quadratization of symmetric pseudo-Boolean functions, Mathematical optimization ideas for biodiversity conservation, On some variants of the merging variables based \((1+1)\)-evolutionary algorithm with application to MaxSAT problem, Weighted model counting without parameter variables, An unconstrained quadratic binary programming approach to the vertex coloring problem, Combinatorial structure and randomized subexponential algorithms for infinite games, Introduction to QUBO, Applications and Computational Advances for Solving the QUBO Model, Autarkies and Persistencies for QUBO, QUBO Software, PBLib – A Library for Encoding Pseudo-Boolean Constraints into CNF, The Expressive Power of Binary Submodular Functions, A Semi-Tensor Product Approach to Pseudo-Boolean Functions with Application to Boolean Control Networks, Template-Based Minor Embedding for Adiabatic Quantum Optimization, The Power of Sherali--Adams Relaxations for General-Valued CSPs, Fast 1-flip neighborhood evaluations for large-scale pseudo-Boolean optimization using posiform representation, Efficient joint object matching via linear programming, The effects of the problem Hamiltonian parameters on the minimum spectral gap in adiabatic quantum optimization, Ising Machines for Diophantine Problems in Physics, Solving larger maximum clique problems using parallel quantum annealing, Generation of synchronizing state machines from a transition system: a region-based approach, Partition Crossover can Linearize Local Optima Lattices of k-bounded Pseudo-Boolean Functions, On optimization problems in acyclic hypergraphs, On the strength of recursive McCormick relaxations for binary polynomial optimization, Efficient linear reformulations for binary polynomial optimization problems, On the complexity of binary polynomial optimization over acyclic hypergraphs, A polyhedral study of lifted multicuts, Computing the Partition Function of a Polynomial on the Boolean Cube, Model Reductions for Inference: Generality of Pairwise, Binary, and Planar Factor Graphs, The fundamental theorem of linear programming: extensions and applications, Nonsmooth cryptanalysis, with an application to the stream cipher MICKEY, The Multilinear Polytope for Acyclic Hypergraphs, Finding Effective SAT Partitionings Via Black-Box Optimization, Tangential Approximation of Surfaces, Multi-period maintenance scheduling of tree networks with minimum flow disruption, Quantum bridge analytics. I: A tutorial on formulating and using QUBO models, Quantum bridge analytics. I: A tutorial on formulating and using QUBO models, Using Merging Variables-Based Local Search to Solve Special Variants of MaxSAT Problem, Merging Variables: One Technique of Search in Pseudo-Boolean Optimization, A Tractable Class of Binary VCSPs via M-Convex Intersection, Revisiting Deep Structured Models for Pixel-Level Labeling with Gradient-Based Inference, Diffusion methods for classification with pairwise relationships, Communication Lower Bounds Using Directional Derivatives, Resource efficient gadgets for compiling adiabatic quantum optimization problems

Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:697569&oldid=12605288"