Pseudo-Boolean optimization
From MaRDI portal
Publication:697569
DOI10.1016/S0166-218X(01)00341-9zbMATH Open1076.90032MaRDI QIDQ697569FDOQ697569
Recommendations
Cites Work
- scientific article; zbMATH DE number 4176831 (Why is no real title available?)
- scientific article; zbMATH DE number 3889431 (Why is no real title available?)
- scientific article; zbMATH DE number 3152649 (Why is no real title available?)
- scientific article; zbMATH DE number 3848971 (Why is no real title available?)
- scientific article; zbMATH DE number 3853102 (Why is no real title available?)
- scientific article; zbMATH DE number 3904328 (Why is no real title available?)
- scientific article; zbMATH DE number 3904619 (Why is no real title available?)
- scientific article; zbMATH DE number 3697017 (Why is no real title available?)
- scientific article; zbMATH DE number 3713491 (Why is no real title available?)
- scientific article; zbMATH DE number 15496 (Why is no real title available?)
- scientific article; zbMATH DE number 53883 (Why is no real title available?)
- scientific article; zbMATH DE number 3461842 (Why is no real title available?)
- scientific article; zbMATH DE number 3465110 (Why is no real title available?)
- scientific article; zbMATH DE number 3473554 (Why is no real title available?)
- scientific article; zbMATH DE number 3534506 (Why is no real title available?)
- scientific article; zbMATH DE number 3564765 (Why is no real title available?)
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 3629008 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1256635 (Why is no real title available?)
- scientific article; zbMATH DE number 1256636 (Why is no real title available?)
- scientific article; zbMATH DE number 1303558 (Why is no real title available?)
- scientific article; zbMATH DE number 1306875 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 1559516 (Why is no real title available?)
- scientific article; zbMATH DE number 4114373 (Why is no real title available?)
- scientific article; zbMATH DE number 3212646 (Why is no real title available?)
- scientific article; zbMATH DE number 3249560 (Why is no real title available?)
- scientific article; zbMATH DE number 3257031 (Why is no real title available?)
- scientific article; zbMATH DE number 3316982 (Why is no real title available?)
- scientific article; zbMATH DE number 3332070 (Why is no real title available?)
- scientific article; zbMATH DE number 3333883 (Why is no real title available?)
- scientific article; zbMATH DE number 3335677 (Why is no real title available?)
- scientific article; zbMATH DE number 3378707 (Why is no real title available?)
- scientific article; zbMATH DE number 3404028 (Why is no real title available?)
- scientific article; zbMATH DE number 3078997 (Why is no real title available?)
- scientific article; zbMATH DE number 3106184 (Why is no real title available?)
- (0, 1) hyperbolic programming problems
- A Cut Approach to the Rectilinear Distance Facility Location Problem
- A Selection Problem of Shared Fixed Costs and Network Flows
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
- A solvable case of quadratic 0-1 programming
- AN ALGORITHM FOR MAXIMUM LIKELIHOOD RANKING AND SLATER'S i FROM PAIRED COMPARISONS
- Algorithms for minclique scheduling problems
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
- An analysis of approximations for maximizing submodular set functions—I
- Applications of pseudo-Boolean methods to economic problems
- Approximation algorithms for combinatorial problems
- Approximations of pseudo-Boolean functions; applications to game theory
- Average Performance of Heuristics for Satisfiability
- Bimatroidal independence systems
- Boolean query optimization and the 0-1 hyperbolic sum problem
- Capital Expenditure Programming and Some Alternative Approaches to Risk
- Chvátal Cuts and Odd Cycle Inequalities in Quadratic 0–1 Optimization
- Cluster Analysis and Mathematical Programming
- Complexity of Partial Satisfaction
- Concave extensions for nonlinear 0-1 maximization problems
- Covering non-uniform hypergraphs
- Cut-Polytopes, Boolean Quadric Polytopes and Nonnegative Quadratic Pseudo-Boolean Functions
- Ein effektiver Branch and Bound-Algorithmus für Boolesche quadratische Optimierungsprobleme
- Exact ground states of Ising spin glasses: new experimental results with a branch-and-cut algorithm
- Facets for the cut cone. I
- Facets for the cut cone. II: Clique-web inequalities
- Facets of the Bipartite Subgraph Polytope
- Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems
- Future paths for integer programming and links to artificial intelligence
- Gadgets, Approximation, and Linear Programming
- Hill Climbing with Multiple Local Optima
- How easy is local search?
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Interactive proofs and the hardness of approximating cliques
- Low order polynomial bounds on the expected performance of local improvement algorithms
- L’algebre de Boole et ses applications en recherche operationnelle
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions
- Maximum cuts: Improvements and local algorithmic analogues of the Edwards-Erdős inequality
- Maximum renamable Horn sub-CNFs
- Methods of Nonlinear 0-1 Programming
- Minimization of half-products
- Minimization of ordered, symmetric half-products
- Minimum cuts and related problems
- Modeling Brain Function
- More characterizations of triangulated graphs
- Multiple optima in local search
- Neural networks and physical systems with emergent collective computational abilities
- New $\frac{3}{4}$-Approximation Algorithms for the Maximum Satisfiability Problem
- New results on the completion time variance minimization
- Nonlinear 0–1 programming: II. Dominance relations and algorithms
- On Some Properties of the Struction of a Graph
- On the Approximation of Maximum Satisfiability
- On the Maximization of a Pseudo-Boolean Function
- On the Set-Covering Problem
- On the cut polytope
- On the equivalence between roof duality and Lagrangian duality for unconstrained \(0\)-\(1\) quadratic programming problems
- On the equivalence of paved-duality and standard linearization in nonlinear 0-1 optimization
- On the integer-valued variables in the linear vertex packing problem
- On the supermodular knapsack problem
- On the use of Boolean methods for the computation of the stability number
- One-pass heuristics for large-scale unconstrained binary quadratic problems
- Optimal Test Generation in Combinational Networks by Pseudo-Boolean Programming
- Optimal cell flipping to minimize channel density in VLSI design and pseudo-Boolean optimization
- Optimization by simulated annealing
- Optimization, approximation, and complexity classes
- Persistency in quadratic 0-1 optimization
- Polynomially solvable cases for the maximum stable set problem
- Probabilistic bounds and algorithms for the maximum satisfiability problem
- Probabilistic construction of deterministic algorithms: approximating packing integer programs
- Pseudo-Boolean Solutions to Multidimensional Location Problems
- Quadratic Binary Programming with Application to Capital-Budgeting Problems
- Quadratic functions with exponential number of local maxima
- Quasimonotone Boolean Functions and Bistellar Graphs
- Quelques utilisations de la STRUCTION. (Some applications of STRUCTION)
- Randomized rounding: A technique for provably good algorithms and algorithmic proofs
- Recognition problems for special classes of polynomials in 0-1 variables
- Roof duality for polynomial 0–1 optimization
- Roof duality, complementation and persistency in quadratic 0–1 optimization
- Set Partitioning: A survey
- Solving satisfiability in less than \(2^ n\) steps
- Some Network Flow Problems Solved with Pseudo-Boolean Programming
- Stability in CAN-free graphs
- Strong unimodularity for matrices and hypergraphs
- Tabu Search—Part I
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- The basic algorithm for pseudo-Boolean programming revisited
- The cut polytope and the Boolean quadric polytope
- The ellipsoid method and its consequences in combinatorial optimization
- The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds
- The quadratic assignment problem
- The struction algorithm for the maximum stable set problem revisited
- The struction of a graph: Application to CN-free graphs
- Unconstrained 0-1 optimization and Lagrangean relaxation
- Unimodular functions
- Upper-bounds for quadratic 0-1 maximization
- Valid inequalities and facets for a hypergraph model of the nonlinear knapsack and the FMS part selection problems
- Vertex packings: Structural properties and algorithms
- Vertices Belonging to All or to No Maximum Stable Sets of a Graph
Cited In (only showing first 100 items - show all)
- A pseudo-Boolean consensus approach to nonlinear 0-1 optimization
- Computing the partition function of a polynomial on the Boolean cube
- A note on representations of linear inequalities in non-convex mixed-integer quadratic programs
- Quadratic and higher-order unconstrained binary optimization of railway rescheduling for quantum computing
- Hard combinatorial problems and minor embeddings on lattice graphs
- The expressive power of valued constraints: Hierarchies and collapses
- Solving larger maximum clique problems using parallel quantum annealing
- The bipartite Boolean quadric polytope
- Uniqueness in quadratic and hyperbolic \(0-1\) programming problems
- Optimal quadratic reformulations of fourth degree pseudo-Boolean functions
- The effects of the problem Hamiltonian parameters on the minimum spectral gap in adiabatic quantum optimization
- Merging variables: one technique of search in pseudo-Boolean optimization
- Solving a cut problem in bipartite graphs by linear programming: application to a forest management problem
- Using merging variables-based local search to solve special variants of MaxSAT problem
- Quantum bridge analytics. I: A tutorial on formulating and using QUBO models
- Subset-conjunctive rules for breast cancer diagnosis
- The fundamental theorem of linear programming: extensions and applications
- On the complexity of binary polynomial optimization over acyclic hypergraphs
- On some variants of the merging variables based \((1+1)\)-evolutionary algorithm with application to MaxSAT problem
- Weighted model counting without parameter variables
- Spin glass and pseudo-Boolean optimization
- Minimizing energies with hierarchical costs
- Fractional 0-1 programs: links between mixed-integer linear and conic quadratic formulations
- Fractional 0-1 programming: applications and algorithms
- A tight lower bound for a special case of quadratic 0-1 programming
- Efficient linear reformulations for binary polynomial optimization problems
- On the complexity and approximation of the maximum expected value all-or-nothing subset
- Compact quadratizations for pseudo-Boolean functions
- Tangential approximation of surfaces
- The power of Sherali-Adams relaxations for general-valued CSPs
- Berge-acyclic multilinear 0-1 optimization problems
- A tractable class of binary VCSPs via M-convex intersection
- A class of valid inequalities for multilinear 0-1 optimization problems
- Efficient local search for pseudo Boolean optimization
- Matroid optimization problems with monotone monomials in the objective
- Fast three-valued abstract bit-vector arithmetic
- Discrete dynamical system approaches for Boolean polynomial optimization
- Fixation probabilities in evolutionary dynamics under weak selection
- Title not available (Why is no real title available?)
- Title not available (Why is no real title available?)
- Diffusion methods for classification with pairwise relationships
- The multilinear polytope for acyclic hypergraphs
- FPGA implementation of a stochastic neural network for monotonic pseudo-Boolean optimization
- Equal risk bounding is better than risk parity for portfolio selection
- A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems
- Communication lower bounds using directional derivatives
- The Expressive Power of Binary Submodular Functions
- Pseudo-Boolean conditional optimization models for a class of multiple traveling salesmen problems
- On optimization problems in acyclic hypergraphs
- Building an iterative heuristic solver for a quantum annealer
- A global optimization algorithm for solving the minimum multiple ratio spanning tree problem
- Synthesis of narrowing enquiries
- Disjunctive analogues of submodular and supermodular pseudo-Boolean functions
- Pseudo-Boolean optimization with a disjunctive constraint
- A network approach for specially structured linear programs arising in 0-1 quadratic optimization
- On the strength of recursive McCormick relaxations for binary polynomial optimization
- Optimal testing and repairing a failed series system
- A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs
- A framework for certified Boolean branch-and-bound optimization
- Quadratization of symmetric pseudo-Boolean functions
- Efficient branch-and-bound algorithms for weighted MAX-2-SAT
- On pseudo-Boolean polynomials
- Exact and approximate discrete optimization algorithms for finding useful disjunctions of categorical predicates in data analysis
- New approaches for optimizing over the semimetric polytope
- A new separation algorithm for the Boolean quadric and cut polytopes
- Generalized roof duality and bisubmodular functions
- An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach
- Optimizing adiabatic quantum program compilation using a graph-theoretic framework
- Quadratic reformulations of nonlinear binary optimization problems
- Minor-embedding in adiabatic quantum computation. II: Minor-universal graph design
- Exact solution approaches for bilevel assignment problems
- An unconstrained quadratic binary programming approach to the vertex coloring problem
- A linearization framework for unconstrained quadratic (0-1) problems
- The unconstrained binary quadratic programming problem: a survey
- On finite potential games
- Minor-embedding in adiabatic quantum computation. I: The parameter setting problem
- Hypercontractive inequality for pseudo-Boolean functions of bounded Fourier width
- Global optimality conditions for quadratic \(0-1\) optimization problems
- The complexity of approximating conservative counting CSPs
- Boolean-controlled systems via receding horizon and linear programing
- The expressive power of binary submodular functions
- A global continuation algorithm for solving binary quadratic programming problems
- Minimizing a linear fractional function subject to a system of sup-\(T\) equations with a continuous Archimedean triangular norm
- Differential approximation schemes for half-product related functions and their scheduling applications
- Approximability issues for unconstrained and constrained maximization of half-product related functions
- From matchings to independent sets
- Branch-and-mincut: global optimization for image segmentation with high-level priors
- Facet-inducing web and antiweb inequalities for the graph coloring polytope
- Stability preserving transformations of graphs
- Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem
- Multi-period maintenance scheduling of tree networks with minimum flow disruption
- Exact solution approach for a class of nonlinear bilevel knapsack problems
- Quadratic convex reformulations for quadratic 0-1 programming
- Cuts in undirected graphs. I
- Fast approximate energy minimization with label costs
- Adiabatic quantum programming: minor embedding with hard faults
- A polyhedral study of lifted multicuts
- Using \(xQx\) to model and solve the uncapacitated task allocation problem
- Satisfying more than half of a system of linear equations over GF(2): a multivariate approach
- A heuristic for Boolean optimization problems
This page was built for publication: Pseudo-Boolean optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q697569)
