Incomplete inference for graph problems (Q1947627): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11590-012-0461-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1968292514 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient solver for weighted Max-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3604010 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution for Max-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411385 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Solving the Partial MAX-SAT Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principles and Practice of Constraint Programming – CP 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Max-SAT Inference-Based Pre-processing for Max-Clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3604009 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624109 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logical approach to efficient Max-SAT solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624095 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Upper Bounds for Maximum Satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4547547 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3604006 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact ground states of Ising spin glasses: new experimental results with a branch-and-cut algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Protein Structure Alignment Using Maximum Cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random constraint satisfaction: easy generation of hard (satisfiable) instances / rank
 
Normal rank

Latest revision as of 09:59, 6 July 2024

scientific article
Language Label Description Also known as
English
Incomplete inference for graph problems
scientific article

    Statements

    Incomplete inference for graph problems (English)
    0 references
    0 references
    23 April 2013
    0 references
    0 references
    max-SAT
    0 references
    inference
    0 references
    minimum vertex covering
    0 references
    max-cut
    0 references
    0 references
    0 references
    0 references