✦ LIBER ✦

Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT: Experimental Evaluation

✍ Scribed by M. Yagiura; T. Ibaraki

Book ID: 110299664
Publisher: Springer US
Year: 2001
Tongue: English
Weight: 155 KB
Volume: 7
Category: Article
ISSN: 1381-1231
DOI: 10.1023/a:1011306011437

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Analyses on the 2 and 3-Flip Neighborhoo

Analyses on the 2 and 3-Flip Neighborhoods for the MAX SAT

✍ M. Yagiura; T. Ibaraki 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 110 KB

Experimental evaluation of a partitionin

Experimental evaluation of a partitioning algorithm for the steiner tree problem in R2 and R3

✍ Sivakumar Ravada; Alan T. Sherman 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 614 KB

## Abstract We experimentally evaluate sequential and distributed implementations of an approximation partitioning algorithm by Kalpakis and Sherman for the __Geometric Steiner Minimum Tree Problem (GSMT)__ in __R^d^__ for __d__ = 2,3. Our implementations incorporate an improved method for combinin