Minimization of a quadratic pseudo-Boolean function
From MaRDI portal
Publication:1341991
DOI10.1016/0377-2217(94)90125-2zbMath0812.90117OpenAlexW2054297043MaRDI QIDQ1341991
Alain Sutter, Alain Billionnet
Publication date: 15 May 1995
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(94)90125-2
branch-and-boundstability numbermaximum satisfiabilityquadratic pseudo-Boolean functionlowre boundzero-one quadratic programming
Related Items
Building an iterative heuristic solver for a quantum annealer ⋮ Thermostatistical persistency: A powerful improving concept for simulated annealing algorithms ⋮ The unconstrained binary quadratic programming problem: a survey ⋮ An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach ⋮ A new approach for modeling and solving set packing problems ⋮ Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem ⋮ Using \(xQx\) to model and solve the uncapacitated task allocation problem ⋮ Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem ⋮ Global equilibrium search applied to the unconstrained binary quadratic optimization problem ⋮ Lagrangean decompositions for the unconstrained binary quadratic programming problem ⋮ Linear programming for the \(0-1\) quadratic knapsack problem ⋮ A linearization framework for unconstrained quadratic (0-1) problems ⋮ Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem ⋮ Simulated annealing for the unconstrained quadratic pseudo-Boolean function ⋮ An unconstrained quadratic binary programming approach to the vertex coloring problem ⋮ ``Miniaturized linearizations for quadratic 0/1 problems
Cites Work
- Unnamed Item
- The indefinite zero-one quadratic problem
- Algorithms for the maximum satisfiability problem
- An exact algorithm for the maximum clique problem
- Experiments in quadratic 0-1 programming
- Persistency in quadratic 0-1 optimization
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- Roof duality, complementation and persistency in quadratic 0–1 optimization
- An Algorithm for Global Minimization of Linearly Constrained Concave Quadratic Functions
- A Computing Procedure for Quantification Theory