Incomplete inference for graph problems

DOI10.1007/S11590-012-0461-0zbMATH Open1269.90128OpenAlexW1968292514MaRDI QIDQ1947627FDOQ1947627

Yanyan Li

Publication date: 23 April 2013

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-012-0461-0

zbMATH Keywords

inferencemax-cutmax-SATminimum vertex covering

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A fast algorithm for the maximum clique problem
• Exact ground states of Ising spin glasses: new experimental results with a branch-and-cut algorithm
• On Solving the Partial MAX-SAT Problem
• Random constraint satisfaction: easy generation of hard (satisfiable) instances
• Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP
• New Upper Bounds for Maximum Satisfiability
• Optimal Protein Structure Alignment Using Maximum Cliques
• A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem
• An efficient solver for weighted Max-SAT
• A logical approach to efficient Max-SAT solving
• Principles and Practice of Constraint Programming – CP 2003
• Resolution for Max-SAT
• A Max-SAT Inference-Based Pre-processing for Max-Clique

Cited In (2)

• Title not available (Why is that?)
• Title not available (Why is that?)

Uses Software

• MiniMaxSat
• HapCUT

This page was built for publication: Incomplete inference for graph problems

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