Using the unconstrained quadratic program to model and solve Max 2-SAT problems

MaRDI QIDQ2505314zbMATH OpenFDO

Authors Gary A. Kochenberger, Fred Glover, Bahram Alidaee, Karen R. Lewis

Publication date 4 October 2006

Published in International Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

metaheuristicscombinatorial optimisationsatisfiabilitypenalty functionsunconstrained quadratic programTabu searchMax 2-SAT problems

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Analysis of algorithms (68W40)

Recommendations

• Solving the weighted MAX-SAT problem using the dynamic convexized method
• Bounds and fast approximation algorithms for binary quadratic optimzation problems with application to MAX 2SAT
• Linear programs for constraint satisfaction problems
• Solving the maximum edge weight clique problem via unconstrained quadratic programming
• Exact Max-SAT solvers for over-constrained problems

Cited in

(9)

• Efficient branch-and-bound algorithms for weighted MAX-2-SAT
• Applications and computational advances for solving the QUBO model
• Quantum bridge analytics. I: A tutorial on formulating and using QUBO models
• The unconstrained binary quadratic programming problem: a survey
• Quantum bridge analytics. I: A tutorial on formulating and using QUBO models
• Fast 1-flip neighborhood evaluations for large-scale pseudo-Boolean optimization using posiform representation
• Solving the maximum edge weight clique problem via unconstrained quadratic programming
• An effective modeling and solution approach for the generalized independent set problem
• A new approach for modeling and solving set packing problems

This page was built for publication: Using the unconstrained quadratic program to model and solve Max 2-SAT problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2505314)