Using the unconstrained quadratic program to model and solve Max 2-SAT problems
From MaRDI portal
Publication:2505314
zbMath1100.90059MaRDI QIDQ2505314
Karen Lewis, Gary A. Kochenberger, Bahram Alidaee, Fred Glover
Publication date: 4 October 2006
Published in: International Journal of Operational Research (Search for Journal in Brave)
metaheuristicsTabu searchpenalty functionssatisfiabilitycombinatorial optimisationunconstrained quadratic programMax 2-SAT problems
Analysis of algorithms (68W40) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Applications and Computational Advances for Solving the QUBO Model, Solving the maximum edge weight clique problem via unconstrained quadratic programming, Fast 1-flip neighborhood evaluations for large-scale pseudo-Boolean optimization using posiform representation, The unconstrained binary quadratic programming problem: a survey, An effective modeling and solution approach for the generalized independent set problem, A new approach for modeling and solving set packing problems, Efficient branch-and-bound algorithms for weighted MAX-2-SAT, Quantum bridge analytics. I: A tutorial on formulating and using QUBO models, Quantum bridge analytics. I: A tutorial on formulating and using QUBO models
