Solving the weighted MAX-SAT problem using the dynamic convexized method (Q2439524): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q415859
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Wen-Xing Zhu / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: DIMACS / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11590-012-0583-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2034923275 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / 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: Approximation and Online Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic aspects in speech recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Free Bits, PCPs, and Nonapproximability---Towards Tight Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principles and Practice of Constraint Programming – CP 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On randomizing two derandomized greedy algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: GRASP with path relinking for the weighted MAXSAT problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4375770 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4550772 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guided local search for solving SAT and weighted MAX-SAT problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4375767 / 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: Solving weighted MAX-SAT via global equilibrium search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687275 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principles and Practice of Constraint Programming – CP 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687272 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete dynamic convexized method for nonlinearly constrained nonlinear integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A discrete dynamic convexized method for nonlinear integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A discrete dynamic convexized method for VLSI circuit partitioning / rank
 
Normal rank

Latest revision as of 11:03, 7 July 2024

scientific article
Language Label Description Also known as
English
Solving the weighted MAX-SAT problem using the dynamic convexized method
scientific article

    Statements

    Solving the weighted MAX-SAT problem using the dynamic convexized method (English)
    0 references
    0 references
    0 references
    14 March 2014
    0 references
    weighted maximum satisfiability
    0 references
    MAX-SAT
    0 references
    dynamic convexized method
    0 references
    local minimizer
    0 references

    Identifiers