Efficient branch-and-bound algorithms for weighted MAX-2-SAT (Q535012): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C57 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 5886687 / rank
 
Normal rank
Property / zbMATH Keywords
 
MAX-2-SAT
Property / zbMATH Keywords: MAX-2-SAT / rank
 
Normal rank
Property / zbMATH Keywords
 
NP-hard
Property / zbMATH Keywords: NP-hard / rank
 
Normal rank
Property / zbMATH Keywords
 
branch-and-bound
Property / zbMATH Keywords: branch-and-bound / rank
 
Normal rank
Property / zbMATH Keywords
 
lower bounds
Property / zbMATH Keywords: lower bounds / rank
 
Normal rank
Property / zbMATH Keywords
 
directed graph
Property / zbMATH Keywords: directed graph / rank
 
Normal rank

Revision as of 09:48, 1 July 2023

scientific article
Language Label Description Also known as
English
Efficient branch-and-bound algorithms for weighted MAX-2-SAT
scientific article

    Statements

    Efficient branch-and-bound algorithms for weighted MAX-2-SAT (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    11 May 2011
    0 references
    0 references
    MAX-2-SAT
    0 references
    NP-hard
    0 references
    branch-and-bound
    0 references
    lower bounds
    0 references
    directed graph
    0 references