A discrete Lagrangian-based global-search method for solving satisfiability problems
From MaRDI portal
Publication:1383842
DOI10.1023/A:1008287028851zbMath0904.90154OpenAlexW1526749820MaRDI QIDQ1383842
Publication date: 13 April 1998
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1008287028851
global optimizationNP-complete problemssatisfiabilitydiscrete Lagrange-multiplier-based global-search method
Related Items (17)
The state of SAT ⋮ Clause weighting local search for SAT ⋮ Automatically improving constraint models in Savile Row ⋮ A semantic relatedness preserved subset extraction method for language corpora based on pseudo-Boolean optimization ⋮ Timescales of Boolean satisfiability solver using continuous-time dynamical system ⋮ Experimental complexity analysis of continuous constraint satisfaction problems. ⋮ Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors. ⋮ Constraint partitioning in penalty formulations for solving temporal planning problems ⋮ The distributed breakout algorithms ⋮ Improving the performance of weighted Lagrange-multiplier methods for nonlinear constrained optimization ⋮ Solving SAT problem by heuristic polarity decision-making algorithm ⋮ Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions ⋮ Practical optimization of group piles using discrete Lagrange multiplier method ⋮ A SAT approach to query optimization in mediator systems ⋮ Local search characteristics of incomplete SAT procedures ⋮ Accelerating numerical simulation of continuous-time Boolean satisfiability solver using discrete gradient ⋮ A Lagrangian reconstruction of GENET
Uses Software
This page was built for publication: A discrete Lagrangian-based global-search method for solving satisfiability problems
