A discrete Lagrangian-based global-search method for solving satisfiability problems

DOI10.1023/A:1008287028851MaRDI QIDQ1383842zbMATH OpenOpenAlexFDO

Authors Yi Shang, Benjamin Wah

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

zbMATH Keywords

global optimizationsatisfiabilityNP-complete problemsdiscrete Lagrange-multiplier-based global-search method

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Recommendations

• scientific article; zbMATH DE number 1114000
• Trace-based methods for solving nonlinear global optimization and satisfiability problems
• scientific article; zbMATH DE number 1954176
• scientific article; zbMATH DE number 776082
• scientific article; zbMATH DE number 1113992

Cited in

(19)

• Advances in Artificial Intelligence – SBIA 2004
• Practical optimization of group piles using discrete Lagrange multiplier method
• Solving SAT problem by heuristic polarity decision-making algorithm
• The state of SAT
• Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions
• The distributed breakout algorithms
• Experimental complexity analysis of continuous constraint satisfaction problems.
• Constraint partitioning in penalty formulations for solving temporal planning problems
• Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors.
• Meta-heuristics and artificial intelligence
• Accelerating numerical simulation of continuous-time Boolean satisfiability solver using discrete gradient
• A SAT approach to query optimization in mediator systems
• Timescales of Boolean satisfiability solver using continuous-time dynamical system
• Automatically improving constraint models in Savile Row
• Clause weighting local search for SAT
• A semantic relatedness preserved subset extraction method for language corpora based on pseudo-Boolean optimization
• Improving the performance of weighted Lagrange-multiplier methods for nonlinear constrained optimization
• A Lagrangian reconstruction of GENET
• Local search characteristics of incomplete SAT procedures

Describes a project that uses

Uses Software

• Genocop
• Walksat

This page was built for publication: A discrete Lagrangian-based global-search method for solving satisfiability problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1383842)