Pages that link to "Item:Q734870"

The following pages link to A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem (Q734870):

Displaying 12 items.

• A universally fastest algorithm for Max 2-sat, Max 2-CSP, and everything in between (Q414887) (← links)
• Efficient branch-and-bound algorithms for weighted MAX-2-SAT (Q535012) (← links)
• A new upper bound for Max-2-SAT: A graph-theoretic approach (Q616992) (← links)
• Improving exact algorithms for MAX-2-SAT (Q812398) (← links)
• A new lower bound on the maximum number of satisfied clauses in Max-SAT and its algorithmic applications (Q1759685) (← links)
• Bounds and fast approximation algorithms for binary quadratic optimzation problems with application to MAX 2SAT (Q1841891) (← links)
• Incomplete inference for graph problems (Q1947627) (← links)
• Iterative and core-guided maxsat solving: a survey and assessment (Q2348540) (← links)
• An improved exact algorithm for least-squares unidimensional scaling (Q2375707) (← links)
• Almost 2-SAT Is Fixed-Parameter Tractable (Extended Abstract) (Q3521946) (← links)
• (Q4425953) (← links)
• A Spectral Method for MAX2SAT in the Planted Solution Model (Q5387750) (← links)