Probabilistic bounds and algorithms for the maximum satisfiability problem

descriptionPublicationkeyboard_double_arrow_right Article 01 Dec 1989 English Publisher:Springer Science and Business Media LLCJournal:Annals of Operations Research, volume 21, pages 109-126 (issn: 0254-5330, eissn: 1572-9338,

Copyright policy )

Authors: Boros, Endre; Prékopa, András;

doi: 10.1007/bf02022095

Probabilistic bounds and algorithms for the maximum satisfiability problem

- Summary
- Subjects
- Metrics

Abstract

zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Related Organizations

Rutgers, The State University of New Jersey
United States

Keywords

Linear programming, Computational methods for problems pertaining to operations research and mathematical programming, heuristic, Boolean programming, maximum satisfiability problem, probabilistic bounds

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	18
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average