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

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: BerkMin / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MiniMaxSat / 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/s10107-009-0285-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2049935674 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for testing the truth of certain quantified Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4511230 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact MAX-2SAT solution via lift-and-project closure / 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: Pseudo-Boolean optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper-bounds for quadratic 0-1 maximization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chvátal Cuts and Odd Cycle Inequalities in Quadratic 0–1 Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On implementing the push-relabel method for the maximum flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computing Procedure for Quantification Theory / 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: Q4550772 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3429154 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Timetable and Multicommodity Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Programming Approach to the Cutting-Stock Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive Memory Tabu Search for Binary Quadratic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4495174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-pass heuristics for large-scale unconstrained binary quadratic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to the maximum-flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: BerkMin: A fast and robust SAT-solver / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2728900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Roof duality, complementation and persistency in quadratic 0–1 optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the maximum satisfiability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4038710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4375770 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical Behavior in the Satisfiability of Random Boolean Expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using the unconstrained quadratic program to model and solve Max 2-SAT problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624095 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bidirectional shortest-path algorithm with good average-case behavior / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3981972 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy and local search heuristics for unconstrained binary quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time algorithm to find an equitable home--away assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming based approaches to the break minimization problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Upper Bounds for Maximum Satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4375767 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Empirical Study of MAX-2-SAT Phase Transitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving exact algorithms for MAX-2-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3865840 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2779815 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687275 / rank
 
Normal rank
Property / cites work
 
Property / cites work: MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analyses on the 2 and 3-flip neighborhoods for the MAX SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient 2 and 3-flip neighborhood search algorithms for the MAX SAT: experimental Evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Approximation of Maximum Satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Algorithms for MAX-SAT / rank
 
Normal rank

Latest revision as of 01:34, 4 July 2024

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
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references