NEW APPROXIMATION ALGORITHMS FOR MAX 2SAT AND MAX DICUT

DOI10.15807/jorsj.46.178zbMath1049.90077OpenAlexW2153689539MaRDI QIDQ4446321

Shiro Matuura, Tomomi Matsui

Publication date: 22 March 2004

Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.15807/jorsj.46.178

zbMATH Keywords

algorithmcombinatorial optimizationnonlinear programming

Mathematics Subject Classification ID

Semidefinite programming (90C22) Combinatorial optimization (90C27)

Related Items (3)

On the directed cut cone and polytope ⋮ Adding cardinality constraints to integer programs with applications to maximum satisfiability ⋮ Semidefinite programming based approaches to the break minimization problem

This page was built for publication: NEW APPROXIMATION ALGORITHMS FOR MAX 2SAT AND MAX DICUT