✦ LIBER ✦

The basic algorithm for pseudo-Boolean programming revisited

✍ Scribed by Yves Crama; Pierre Hansen; Brigitte Jaumard

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 961 KB
Volume: 29
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(90)90142-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The worst case behavior of a greedy algo

The worst case behavior of a greedy algorithm for a class of pseudo-Boolean functions

✍ M.R. Emamy-K. 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 162 KB

The method of hyperspheres for solving p

The method of hyperspheres for solving problems of boolean programming

✍ Dzh.A. Babaev 📂 Article 📅 1976 🏛 Elsevier Science ⚖ 847 KB

Revisiting the COUNTER algorithms for li

Revisiting the COUNTER algorithms for list update

✍ Susanne Albers; Michael Mitzenmacher 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 579 KB

A FORTRAN program for the solution of si

A FORTRAN program for the solution of simultaneous linear Boolean inequalities by the algorithm of Hammer and Rudeanu

✍ A.M Lesk 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 174 KB

A MIMD implementation of the Buchberger

A MIMD implementation of the Buchberger Algorithm for Boolean polynomials

✍ P. Senechaud 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 413 KB

Senechaud, P\_, A MIMD implementation of the Buchberger algorithm for Boolean polynomials, Parallel Computing 17 (1991) 29-37\_ In this note we present two methods to compute GriSbner basis in parallel, both based on Buchberger's sequential algorithm. A distributed memory MIMD computer (the FPS T40

Pseudo-time algorithms for the Navier-St

Pseudo-time algorithms for the Navier-Stokes equations

✍ R.C. Swanson; E. Turkel 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 856 KB