✦ LIBER ✦

Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems

✍ Scribed by Bezáková, Ivona; Štefankovič, Daniel; Vazirani, Vijay V.; Vigoda, Eric

Book ID: 118180709
Publisher: Society for Industrial and Applied Mathematics
Year: 2008
Tongue: English
Weight: 307 KB
Volume: 37
Category: Article
ISSN: 0097-5397
DOI: 10.1137/050644033

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Novel, Evolutionary, Simulated Anneali

A Novel, Evolutionary, Simulated Annealing inspired Algorithm for the Multi-Objective Optimization of Combinatorial Problems

✍ Nino, Elias D.; Ardila, Carlos J.; Chinchilla, Anangelica 📂 Article 📅 2012 🏛 Elsevier 🌐 English ⚖ 418 KB

Simulated annealing and tabu search appr

Simulated annealing and tabu search approaches for the Corridor Allocation Problem

✍ Ahonen, H.; de Alvarenga, A.G.; Amaral, A.R.S. 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 500 KB

The Cascade Vulnerability Problem: the d

The Cascade Vulnerability Problem: the detection problem and a simulated annealing approach for its correction

✍ Stefanos Gritzalis; Diomidis Spinellis 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 681 KB

A simulated annealing and hill-climbing

A simulated annealing and hill-climbing algorithm for the traveling tournament problem

✍ A. Lim; B. Rodrigues; X. Zhang 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 217 KB

Simulated Annealing and Genetic Algorith

Simulated Annealing and Genetic Algorithms for the Facility Layout Problem: A Survey

✍ Thelma D. Mavridou; Panos M. Pardalos 📂 Article 📅 1997 🏛 Springer US 🌐 English ⚖ 216 KB

Decomposition and hybrid simulated annea

Decomposition and hybrid simulated annealing heuristics for the parallel-machine total tardiness problem

✍ Christos Koulamas 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 93 KB 👁 2 views

A polynomial decomposition heuristic is developed for the parallel-machine tardiness problem (P//T V ) by extending the decomposition principle embedded in the single-machine tardiness problem (1//T V ) to a parallel-machine setting. The subproblems generated by the decomposition are solved by an ef